The size Ramsey number of a directed path

DOI10.1016/j.jctb.2011.10.002zbMath1245.05041arXiv1005.5171OpenAlexW2066508430MaRDI QIDQ414648

Michael Krivelevich, Ido Ben-Eliezer, Benjamin Sudakov

Publication date: 11 May 2012

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

Full work available at URL: https://arxiv.org/abs/1005.5171

zbMATH Keywords

Ramsey theorysize Ramsey numbermonochromatic directed paths

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (35)

The \(m\)-degenerate chromatic number of a digraph ⋮ Fast Strategies In Maker–Breaker Games Played on Random Boards ⋮ Long cycles in subgraphs of (pseudo)random directed graphs ⋮ Large monochromatic components and long monochromatic cycles in random hypergraphs ⋮ Note on the multicolour size-Ramsey number for paths ⋮ 2-universality in randomly perturbed graphs ⋮ Oriented discrepancy of Hamilton cycles ⋮ The largest hole in sparse random graphs ⋮ Cycle lengths in randomly perturbed graphs ⋮ The oriented size Ramsey number of directed paths ⋮ Color‐biased Hamilton cycles in random graphs ⋮ Monochromatic paths in random tournaments ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ The multicolour size-Ramsey number of powers of paths ⋮ Monochromatic paths in 2-edge-coloured graphs and hypergraphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ Perfect matchings and Hamiltonian cycles in the preferential attachment model ⋮ Client-waiter games on complete and random graphs ⋮ Lower bounds of size Ramsey number for graphs with small independence number ⋮ Ramsey Goodness of Clique Versus Paths in Random Graphs ⋮ Size-Ramsey numbers of cycles versus a path ⋮ The size-Ramsey number of 3-uniform tight paths ⋮ Last passage percolation on the complete graph ⋮ Directed Ramsey number for trees ⋮ On edge‐ordered Ramsey numbers ⋮ Ordered size Ramsey number of paths ⋮ A strengthening of the Erdős-Szekeres theorem ⋮ Monochromatic trees in random tournaments ⋮ Longest cycles in sparse random digraphs ⋮ Partitioning a graph into a cycle and a sparse graph ⋮ Submodular functions and rooted trees ⋮ The connected size Ramsey number for matchings versus small disconnected graphs ⋮ The multicolor size-Ramsey numbers of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Expanding graphs contain all small trees
• Explicit construction of linear sized tolerant networks
• The size Ramsey number
• The Ramsey size number of dipaths
• Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
• On a Ramsey type theorem
• Sur le circuit hamiltonien bi-colore dans les graphes orientes
• 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
• Acyclic systems of representatives and acyclic colorings of digraphs
• On size Ramsey number of paths, trees, and circuits. I
• Vertex coverings by monochromatic paths and cycles
• Nombre chromatique et plus longs chemins d'un graphe
• Simulating independence

This page was built for publication: The size Ramsey number of a directed path