Nearly bipartite graphs with large chromatic number

DOI10.1007/BF02579434zbMath0512.05030OpenAlexW2037617500MaRDI QIDQ1839258

Vojtěch Rödl

Publication date: 1982

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579434

zbMATH Keywords

chromatic numberbipartite subgraph3-uniform hypergraphsdeletion of edges

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY

Cites Work

• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• On the combinatorial problems which I would most like to see solved
• A short proof of Kneser's conjecture
• Graph Theory and Probability
• Applications of product colouring