Growth rates of the bipartite Erdős-Gyárfás function
From MaRDI portal
Publication:6642509
DOI10.1002/jgt.23149MaRDI QIDQ6642509
Xihe Li, Hajo Broersma, Ligong Wang
Publication date: 24 November 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Erdős distinct distances problem in the plane
- An explicit construction for a Ramsey problem
- Asymptotic solution for a new class of forbidden r-graphs
- On a class of degenerate extremal graph problems
- On multicolor Ramsey numbers for complete bipartite graphs
- A variant of the classical Ramsey problem
- A generalized Ramsey problem
- On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
- Compactness results in extremal graph theory
- On generalized Ramsey theory: The bipartite case
- Improved bounds for the extremal number of subdivisions
- The Schur-Erdős problem for semi-algebraic colorings
- A survey of hypergraph Ramsey problems
- Generalized Ramsey numbers: forbidding paths with few colors
- The sub-exponential transition for the chromatic generalized Ramsey numbers
- Local properties in colored graphs, distinct distances, and difference sets
- An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)
- On extremal problems of graphs and generalized graphs
- Coloring triple systems with local conditions
- The Erdős-Gyárfás problem on generalized Ramsey numbers
- On the Grid Ramsey Problem and Related Questions: Fig. 1.
- Extremal Combinatorics
- Recent developments in graph Ramsey theory
- An application of the regularity lemma in generalized Ramsey theory
- A (5,5)-Colouring of Kn with Few Colours
- Turán numbers of theta graphs
- Ramsey-Type Problem for an Almost Monochromatic $K_4$
- Local Properties via Color Energy Graphs and Forbidden Configurations
- A Note on Bipartite Graphs Without 2 k -Cycles
- On a problem of K. Zarankiewicz
- On Sets of Distances of n Points
- Lower bounds on the Erdős–Gyárfás problem via color energy graphs
- The Erdős–Gyárfás function with respect to Gallai‐colorings
This page was built for publication: Growth rates of the bipartite Erdős-Gyárfás function
