Results 41 to 50 of about 208 (119)

An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth

Journal of Graph Theory, Volume 112, Issue 4, Page 409-420, August 2026.
ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth. We improve on this by showing that graphs of cliquewidth k admit a partition with ‘local,
Marc Distel
wiley   +1 more source

The Structure of Vertebrate Antigen Receptor Repertoires: An Evolutionary Perspective

Immunological Reviews, Volume 341, Issue 1, August 2026.
ABSTRACT In vertebrate adaptive immune systems, somatically diversified antigen receptors assume a central role in self/nonself discrimination. Attesting to the presence of a unique but unknown selective environment at early stages of vertebrate evolution, this facility emerged twice, in the ancestors of jawless and jawed vertebrates.
Thomas Boehm, Orlando B. Giorgetti
wiley   +1 more source

On a Ramsey–Turán variant of Roth's theorem

Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.
Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić, Micha Christoph, Jaehoon Kim, Hyunwoo Lee, Varun Sivashankar   +4 more
wiley   +1 more source

Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs

Contemporary Mathematics and Applications (ConMathA)
Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph.
Muhammad Usaid Hudloir, Dafik, Robiatul Adawiyah, Rafiantika Megahnia Prihandini, Arika Indah Kristiana   +4 more
doaj   +1 more source

Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings

Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.
Abstract In 1973, Erdős conjectured the existence of high girth (n,3,2)$(n,3,2)$‐Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Recently, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Michelle Delcourt, Luke Postle
wiley   +1 more source

On the RACN of the comb product of the cycle C_3 with path P_n and broom Br_(n,m)

Journal Focus Action of Research Mathematic
The combination of rainbow coloring and anti-magic labeling is known as Rainbow Antimagic Coloring (RAC). The Rainbow Antimagic Connection Number (RACN) of a graph G is the smallest number of colors induced by all edge weights under an antimagic labeling,
Brian Juned Septory, Dwi Agustin Retnowardani, Kamal Dliou   +2 more
doaj   +1 more source

Lower bounds for cube‐ideal set‐systems

Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.
Abstract A set‐system S⊆{0,1}n$S\subseteq \lbrace 0,1\rbrace ^n$ is cube‐ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential lower bounds on the size of cube‐ideal set‐systems, and linear lower bounds on their ...
Ahmad Abdi, Gérard Cornuéjols, Daniel Dadush, Mahsa Dalirrooyfard   +3 more
wiley   +1 more source

Inside a duck‐billed dinosaur: Vertebral bone microstructure of Huallasaurus (Hadrosauridae), Upper Cretaceous of Patagonia

The Anatomical Record, Volume 309, Issue 7, Page 1702-1712, July 2026.
Abstract Dinosaurs evolved a unique respiratory system with air sacs that contributed to their evolutionary success. Postcranial skeletal pneumaticity (PSP) has been used to infer the presence of air sac systems in some fossil archosaurs. While unambiguous evidence of PSP is well documented in pterosaurs and post‐Carnian saurischians, it remains absent
Tito Aureliano, Aline M. Ghilardi, Jonatan Kaluza, Agustín G. Martinelli   +3 more
wiley   +1 more source

Rainbow connection number of corona product of graphs

Electronic Journal of Graph Theory and Applications
In an edge-colored graph (where adjacent edges may have the same color), a rainbow path is a path whose edge colors are all distinct. The coloring is called a rainbow coloring if any two vertices can be connected by a rainbow path. The rainbow connection
Fendy Septyanto
doaj   +1 more source

Rainbow Connection Number of Octopus Iteration Graphs

InPrime
The rainbow connection number of a graph G denoted by rc(G) is the minimum number of colors used to color the edges in G, such that every pair of vertices is connected by a path with all different colors. In 2008, Chartrand et al.
Desi Rahmadani, Adinda Evelyn Giyanatta, Dina Pratiwi, Mahmuddin Yunus, Vita Kusumasari   +4 more
doaj   +1 more source