The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right

DOI10.1016/J.JCTB.2024.07.001zbMATH Open1548.05109MaRDI QIDQ6615756

Andrzej Dudek, Ryan Cushman, Paweł Prałat, Patrick Bennett

Publication date: 8 October 2024

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

differential equation method\((p, q)\)-colorings

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the random greedy triangle-packing algorithm
• An explicit construction for a Ramsey problem
• On tail probabilities for martingales
• A variant of the classical Ramsey problem
• Edge-coloring cliques with three colors on all 4-cliques
• A generalized Ramsey problem
• On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
• Differential equations for random processes and random graphs
• Local properties in colored graphs, distinct distances, and difference sets
• An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)
• Random triangle removal
• A combinatorial problem in geometry.
• A gentle introduction to the differential equation method and dynamic concentration
• The probabilistic method
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• To Prove and Conjecture: Paul Erdos and His Mathematics
• An application of the regularity lemma in generalized Ramsey theory
• A (5,5)-Colouring of K_n with Few Colours
• Ramsey-Type Problem for an Almost Monochromatic $K_4$
• Local Properties via Color Energy Graphs and Forbidden Configurations
• Solutions of ordinary differential equations as limits of pure jump markov processes
• Conflict-free hypergraph matchings
• The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right

Related Items (2)

Ramsey theory constructions from hypergraph matchings ⋮ The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right

This page was built for publication: The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615756)