Independent sets and repeated degrees

DOI10.1016/0012-365X(95)00355-ZzbMath0881.05071OpenAlexW2104082818MaRDI QIDQ1363652

Alexander D. Scott, Béla Bollobás

Publication date: 16 February 1998

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

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

zbMATH Keywords

independence numbertriangle-free graphindependent setsrepeated degrees

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (6)

Equating \(\kappa\) maximum degrees in graphs without short cycles ⋮ Forcing \(k\)-repetitions in degree sequences ⋮ Large induced subgraphs with three repeated degrees ⋮ Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree ⋮ Large induced subgraphs with equated maximum degree ⋮ Equating two maximum degrees

Cites Work

• Degree sequences in triangle-free graphs
• Degree sequence and independence in \(K(4)\)-free graphs

This page was built for publication: Independent sets and repeated degrees