scientific article
From MaRDI portal
Publication:3060865
zbMath1218.05147MaRDI QIDQ3060865
Publication date: 13 December 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10)
Related Items (18)
Bounds for graph regularity and removal lemmas ⋮ New upper bounds for Ramsey numbers of books ⋮ Ramsey numbers of large books ⋮ Geometrical sets with forbidden configurations ⋮ Local-vs-global combinatorics ⋮ Testable and untestable classes of first-order formulae ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ Extremal results in sparse pseudorandom graphs ⋮ On the KŁR conjecture in random graphs ⋮ A sparse regular approximation lemma ⋮ The critical window for the classical Ramsey-Turán problem ⋮ Unnamed Item ⋮ A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma ⋮ Sprinkling a Few Random Edges Doubles the Power ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Robustness of randomized rumour spreading ⋮ A tight bound for hypergraph regularity ⋮ The regularity method for graphs with few 4‐cycles
This page was built for publication:
