Degree multiplicities and independent sets in \(K_ 4\)-free graphs

DOI10.1016/0012-365X(95)00002-EzbMath0858.05056OpenAlexW2147283108MaRDI QIDQ1815307

Béla Bollobás

Publication date: 7 November 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00002-e

zbMATH Keywords

degreeindependence number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

Forcing \(k\)-repetitions in degree sequences ⋮ Large induced subgraphs with three repeated degrees ⋮ Large induced subgraphs with equated maximum degree ⋮ Equating two maximum degrees

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Degree sequences in triangle-free graphs
• On a Ramsey-Turán type problem
• Graph Theory and Probability
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degree multiplicities and independent sets in \(K_ 4\)-free graphs