On hypergraph cliques with chromatic number 3

MaRDI QIDQ446285zbMATH OpenFDO

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 numbercliquecovering numberhypergraph

Mathematics Subject Classification ID

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

Cited in

(8)

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

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)