The \(B_r\) property and chromatic numbers of generalized graphs

DOI10.1016/0095-8956(72)90031-7zbMath0236.05123OpenAlexW2089842120MaRDI QIDQ2552143

Marcel Herzog, J. Schönheim

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90031-7

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of partitions of integers (05A17) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

A contribution to the chromatic theory of uniform hypergraphs ⋮ Some properties of non-bicolorable hypergraphs and the four-color problem ⋮ Extremal problems in hypergraph colourings ⋮ An extremal problem in hypergraph coloring ⋮ On property \(B_r\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a Combinatorial Problem of Erdös and Hajnal
• Ein kombinatorisches Problem von P. Erdős und A. Hajnal
• On a property of families of sets
• On a combinatorial problem. II

This page was built for publication: The \(B_r\) property and chromatic numbers of generalized graphs