A certain combinatorial inequality

DOI10.1007/BF00969645MaRDI QIDQ1121902zbMATH OpenFDO

Authors Vladimir L. Dol'nikov

Publication date 1988

Published in Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

chromatic numberhypergraphindependence numberKneser's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• Kneser's conjecture, chromatic number, and homotopy

Cited in

(14)

• A combinatorial inequality
• Colorings of complements of line graphs
• Topological bounds for graph representations over any field
• Tverberg’s theorem is 50 years old: A survey
• On the number of star‐shaped classes in optimal colorings of Kneser graphs
• On the chromatic number of Kneser hypergraphs
• Some new inequalities in additive combinatorics
• Hadwiger's conjecture and topological bounds
• Intersection patterns of finite sets and of convex sets
• Coloring properties of categorical product of general Kneser hypergraphs
• A new coloring theorem of Kneser graphs
• Hedetniemi's conjecture for Kneser hypergraphs
• Strengthening topological colorful results for graphs
• Circular chromatic number of induced subgraphs of Kneser graphs

This page was built for publication: A certain combinatorial inequality

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