On hypergraph cliques with chromatic number 3

zbMATH Open1255.05101MaRDI QIDQ446285FDOQ446285

Authors Danila Cherkashin

Publication date 5 September 2012

Published in Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

zbMATH Keywords

chromatic numbercovering numbercliquehypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cited in

(7)

• Coloring cross-intersecting families
• Independence numbers of Johnson-type graphs
• Extremal problems in hypergraph colourings
• Clustered 3-colouring graphs of bounded degree
• A general framework for hypergraph coloring
• The Cayley isomorphism property for Cayley maps
• On the size of maximal intersecting families

This page was built for publication: On hypergraph cliques with chromatic number 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q446285)