Ramsey-nice families of graphs

DOI10.1016/j.ejc.2018.04.007zbMath1390.05192arXiv1708.07369OpenAlexW2745779757MaRDI QIDQ1645058

Ron Aharoni, Michal Amir, Dan Hefetz, Noga Alon, Alon Naor, Gal Kronenberg, Zilin Jiang, Penny E. Haxell

Publication date: 28 June 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

monochromatic copy

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (1)

Problems close to my heart

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Ramsey type result for oriented trees
• Longest partial transversals in plexes
• Colouring graphs when the number of colours is almost the maximum degree
• Ramsey numbers for the path with three edges
• Monochromatic directed walks in arc-colored directed graphs
• A survey of Kirkman triple systems and related designs
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• A strengthening of Brooks' theorem
• Nearly perfect matchings in regular simple hypergraphs
• Generalised Ramsey numbers for small graphs
• Monochromatic paths in edge-colored graphs
• On a Generalization of the Ryser-Brualdi-Stein Conjecture
• Graph Theory and Probability
• Asymptotic Existence of Resolvable Graph Designs
• The Ramsey number for stripes
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]
• Nombre chromatique et plus longs chemins d'un graphe
• Zur algebraischen Begründung der Graphentheorie. I
• On the degree, size, and chromatic index of a uniform hypergraph

This page was built for publication: Ramsey-nice families of graphs