Globally sparse vertex‐ramsey graphs
From MaRDI portal
Publication:4277989
DOI10.1002/jgt.3190180108zbMath0790.05027OpenAlexW2132122319MaRDI QIDQ4277989
Andrzej Ruciński, Andrzej Kurek
Publication date: 22 June 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190180108
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)
Related Items (7)
On globally sparse Ramsey graphs ⋮ On 1-improper 2-coloring of sparse graphs ⋮ An (F1,F4)‐partition of graphs with low genus and girth at least 6 ⋮ Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs ⋮ On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree ⋮ Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions ⋮ Coloring random graphs online without creating monochromatic subgraphs
Cites Work
- Ramsey properties of random graphs
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Three hundred million points suffice
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- A note on defective colorings of graphs in surfaces
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- The Construction of Certain Graphs
This page was built for publication: Globally sparse vertex‐ramsey graphs
