A hypergraph-free construction of highly chromatic graphs without short cycles

DOI10.1007/BF02124683zbMath0703.05023OpenAlexW1507165844MaRDI QIDQ915736

Igor Kriz

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberlength of cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Coloring, sparseness and girth ⋮ Some theorems concerning the star chromatic number of a graph ⋮ Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization ⋮ High girth and extendability ⋮ Dualities and dual pairs in Heyting algebras ⋮ Critical graphs without triangles: an optimum density construction ⋮ Unnamed Item ⋮ Chromatic number of Hasse diagrams, eyebrows and dimension ⋮ A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth ⋮ High girth hypergraphs with unavoidable monochromatic or rainbow edges

Cites Work

• A short proof of the existence of highly chromatic hypergraphs without short cycles
• On chromatic number of graphs and set-systems
• Unnamed Item

This page was built for publication: A hypergraph-free construction of highly chromatic graphs without short cycles