Results 31 to 40 of about 21,746 (178)
Bipartite Ramsey numbers and Zarankiewicz numbers
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goddard, Wayne +2 more
openaire +1 more source
Cycles are strongly Ramsey-unsaturated
, 2012 We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey number r(H) of H does not change upon adding it to H.
Burr +4 more
core +1 more source
On Generalizations of Pairwise Compatibility Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri +3 more
doaj +1 more source
Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs [PDF]
Journal of Graph Theory, 2013 AbstractLet be graphs. The multicolor Ramsey number is the minimum integer r such that in every edge‐coloring of by k colors, there is a monochromatic copy of in color i for some . In this paper, we investigate the multicolor Ramsey number , determining the asymptotic behavior up to a polylogarithmic factor for almost all ranges of t and m. Several
Lenz, John, Mubayi, Dhruv
openaire +2 more sources
Local colourings and monochromatic partitions in complete bipartite graphs
, 2016 We show that for any $2$-local colouring of the edges of the balanced complete bipartite graph $K_{n,n}$, its vertices can be covered with at most~$3$ disjoint monochromatic paths.
Lang, Richard, Stein, Maya
core +1 more source
Star-path and star-stripe bipartite Ramsey numbers in multicoloring [PDF]
Transactions on Combinatorics, 2015 For given bipartite graphs G 1 ,G 2 ,…,G t , the bipartite Ramsey number bR(G 1 ,G 2 ,…,G t ) is the smallest integer n such that if the edges of the complete bipartite graph K n,n are partitioned into t disjoint color classes giving t ...
Ghaffar Raeisi
doaj
Almost-Rainbow Edge-Colorings of Some Small Subgraphs
Discussiones Mathematicae Graph Theory, 2013 Let f(n, p, q) be the minimum number of colors necessary to color the edges of Kn so that every Kp is at least q-colored. We improve current bounds on these nearly “anti-Ramsey” numbers, first studied by Erdös and Gyárfás.
Krop Elliot, Krop Irina
doaj +1 more source
Molecular Ecology, Volume 35, Issue 3, February 2026.ABSTRACT Understanding gene flow between ploidy levels in polyploid complexes is essential for species delimitation and conservation. This study explores evolutionary dynamics in the polyploid complex Thymus sect. Mastichina (Lamiaceae), comprising three taxa: T. mastichina subsp. mastichina, T. mastichina subsp.
Francisco José García‐Cárdenas +7 more
wiley +1 more source
On the Geometric Ramsey Number of Outerplanar Graphs
, 2013 We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on $2n$ vertices are bounded by $O(n^{3})$ and $O(
Cibulka, Josef +4 more
core +1 more source
Secure Authentication via Quantum Physical Unclonable Functions: A Review
Advanced Quantum Technologies, Volume 9, Issue 1, January 2026.This in‐depth review article examines the origins, development, and evolution of Quantum Physical Unclonable Functions (QPUFs), with a particular focus on their use in secure authentication. The topic is motivated and introduced in detail, addressing both theoretical foundations and practical implementations, and is supported by a systematic article ...
Pol Julià Farré +8 more
wiley +1 more source