Generalized Ramsey numbers: forbidding paths with few colors

DOI10.37236/8801zbMath1435.05140arXiv1906.06935OpenAlexW3006879085MaRDI QIDQ2309212

Robert A. Krueger

Publication date: 30 March 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey problem

Mathematics Subject Classification ID

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

Related Items

Rainbow subgraphs in edge-colored planar and outerplanar graphs ⋮ 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 ⋮ Color Isomorphic Even Cycles and a Related Ramsey Problem ⋮ Repeated Patterns in Proper Colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A variant of the classical Ramsey problem
• On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
• On generalized Ramsey theory: The bipartite case
• Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings
• Local properties in colored graphs, distinct distances, and difference sets
• On extremal problems of graphs and generalized graphs
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• On maximal paths and circuits of graphs
• An application of the regularity lemma in generalized Ramsey theory
• Maximal antiramsey graphs and the strong chromatic number
• The History of Degenerate (Bipartite) Extremal Graph Problems