Ramsey numbers of sparse digraphs
From MaRDI portal
Publication:6635126
DOI10.1007/S11856-024-2624-YMaRDI QIDQ6635126
Yuval Wigderson, Jacob Fox, Xiaoyu He
Publication date: 9 November 2024
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
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?)
- Short proofs of some extremal results. II.
- A conjecture of Erdős on graph Ramsey numbers
- A new upper bound for diagonal Ramsey numbers
- Ramsey-type theorems
- The Ramsey number of a graph with bounded maximum degree
- Two remarks on the Burr-Erdős conjecture
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Ramsey's theorem - a new lower bound
- Some Ramsey nu mbers for directed graphs
- Ramsey numbers of degenerate graphs
- Monochromatic paths in edge-colored graphs
- A Ramsey-type problem in directed and bipartite graphs
- A proof of Sumner's universal tournament conjecture for large tournaments
- Recent developments in graph Ramsey theory
- The Voting Problem
- Paths and Cycles in Tournaments
- An inequality involving the vertex arboricity and edge arboricity of a graph
- On graphs with linear Ramsey numbers
- Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
- On Ramsey Numbers of Sparse Graphs
- The Ramsey number of dense graphs
- Graphs and Geometry
- Nombre chromatique et plus longs chemins d'un graphe
- Zur algebraischen Begründung der Graphentheorie. I
- Powers of paths in tournaments
- Ordered Ramsey numbers
- Trees in tournaments
- Directed Ramsey number for trees
- Trees in tournaments
- On the unavoidability of oriented trees
- Ramsey numbers of ordered graphs
- Trees in tournaments
- Diagonal Ramsey via effective quasirandomness
Related Items (1)
This page was built for publication: Ramsey numbers of sparse digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635126)