The average size of an independent set in graphs with a given chromatic number

DOI10.1016/0095-8956(88)90060-3zbMath0602.05037OpenAlexW2012536454MaRDI QIDQ1081615

Noga Alon

Publication date: 1988

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(88)90060-3

zbMATH Keywords

graphindependent setchromatic number

Mathematics Subject Classification ID

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

Related Items (1)

Counting Independent Sets in Hypergraphs

Cites Work

• Unnamed Item
• Every poset has a central element

This page was built for publication: The average size of an independent set in graphs with a given chromatic number