A certain combinatorial inequality
From MaRDI portal
Publication:1121902
DOI10.1007/BF00969645zbMath0675.05031MaRDI QIDQ1121902
Publication date: 1988
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (11)
Strengthening topological colorful results for graphs ⋮ Colorings of complements of line graphs ⋮ On the number of star‐shaped classes in optimal colorings of Kneser graphs ⋮ On the chromatic number of Kneser hypergraphs ⋮ A new coloring theorem of Kneser graphs ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ Intersection patterns of finite sets and of convex sets ⋮ Topological Bounds for Graph Representations over Any Field ⋮ Hedetniemi's conjecture for Kneser hypergraphs ⋮ Tverberg’s theorem is 50 years old: A survey
Cites Work
This page was built for publication: A certain combinatorial inequality
