Results 71 to 80 of about 9,765,356 (168)
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 MathematicThe 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 +2 more
doaj +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ć +4 more
wiley +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
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 +3 more
wiley +1 more source
Bilangan rainbow connection dari hasil operasi penjumlahan dan perkalian kartesius dua graf [PDF]
, 2012 INDONESIA: Graf G dengan pewarnaan sisi disebut pelangi sisi terhubung, jika setiap titik pada graf G dihubungkan oleh lintasan yang memiliki sisi-sisi dengan warna yang berbeda.
Fuad Adi Saputra, Saputra, Fuad Adi
core +1 more source
On the (Strong) Rainbow Vertex Connection of Graphs Resulting from Edge Comb Product
, 2018 The vertex-colored graph G = (V, E) is said rainbow vertex-connected, if for every two vertices u and v in V, there is a u − v path with all internal vertices have distinct color.
Dafik, Slamin, Agustina Muharromah
semanticscholar +1 more source
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 +3 more
wiley +1 more source
The rainbow vertex-index of complementary graphs [PDF]
, 2015 A vertex-colored graph $G$ is \emph{rainbow vertex-connected} if two vertices are connected by a path whose internal vertices have distinct colors. The \emph{rainbow vertex-connection number} of a connected graph $G$, denoted by $rvc(G)$, is the smallest
Ye, Chengfu +3 more
core
Rainbow Connection Number Pada Operasi Graf [PDF]
, 2014 An edge-colouring of a graph $G$ is rainbow connected if there are $k$ internally vertex-disjoint paths joining them, with no two edges on the path have the same color.
Yulianti S, Arnasyitha, Dafik, Dafik
core
Rainbow Connection Number of Special Graph and Its Operations [PDF]
, 2014 Let $G$ be a simple graph. An edge-coloring of a graph $G$ is rainbow connected if, for any two vertices of $G$, there are $k$ internally vertex-disjoint paths joining them, each of which is rainbow and then a minimal numbers of color $G$ is required to ...
Nastiti, Artanty, Dafik, Dafik
core