There exist graphs with super‐exponential Ramsey multiplicity constant
From MaRDI portal
Publication:5441404
DOI10.1002/jgt.20256zbMath1137.05049OpenAlexW4252930067MaRDI QIDQ5441404
Publication date: 13 February 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20256
Related Items (14)
On tripartite common graphs ⋮ Non-bipartite \(k\)-common graphs ⋮ An approximate version of Sidorenko's conjecture ⋮ Toward characterizing locally common graphs ⋮ A Property on Monochromatic Copies of Graphs Containing a Triangle ⋮ Common graphs with arbitrary connectivity and chromatic number ⋮ Extended commonality of paths and cycles via Schur convexity ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Extremal results in sparse pseudorandom graphs ⋮ Monochromatic triangles in three-coloured graphs ⋮ Extremal problems and results related to Gallai-colorings ⋮ Anti-Ramsey Multiplicities ⋮ Short proofs of some extremal results III ⋮ Threshold Ramsey multiplicity for paths and even cycles
Cites Work
This page was built for publication: There exist graphs with super‐exponential Ramsey multiplicity constant
