A certain combinatorial inequality

DOI10.1007/BF00969645zbMATH Open0675.05031MaRDI QIDQ1121902FDOQ1121902

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

• Kneser's conjecture, chromatic number, and homotopy
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• Topological Bounds for Graph Representations over Any Field
• Coloring properties of categorical product of general Kneser hypergraphs
• Hedetniemi's conjecture for Kneser hypergraphs
• On the number of star‐shaped classes in optimal colorings of Kneser graphs
• Intersection patterns of finite sets and of convex sets
• Some new inequalities in additive combinatorics
• Strengthening topological colorful results for graphs
• Hadwiger's conjecture and topological bounds
• Tverberg’s theorem is 50 years old: A survey
• On the chromatic number of Kneser hypergraphs
• Circular chromatic number of induced subgraphs of Kneser graphs
• A combinatorial inequality
• Colorings of complements of line graphs
• A new coloring theorem 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)