Independent sets and repeated degrees

DOI10.1016/0012-365X(95)00355-ZMaRDI QIDQ1363652zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Alex Scott

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)

Recommendations

• Triangle-free regular graphs
• Size and independence in triangle‐free graphs with maximum degree three
• A note on the independence number of triangle-free graphs. II
• On the tightness of the \(\frac {5}{14}\) independence ratio

Cites work

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

Cited in

(12)

• Equating \(\kappa\) maximum degrees in graphs without short cycles
• Forcing k-repetitions in degree sequences
• Equating two maximum degrees
• Large induced subgraphs with equated maximum degree
• Large induced subgraphs with \(k\) vertices of almost maximum degree
• scientific article; zbMATH DE number 140115 (Why is no real title available?)
• Degree multiplicities and independent sets in \(K_ 4\)-free graphs
• scientific article; zbMATH DE number 845597 (Why is no real title available?)
• Independent sets and second category
• Large induced subgraphs with three repeated degrees
• scientific article; zbMATH DE number 3941572 (Why is no real title available?)
• Degree sequence and independence in K(4)-free graphs

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

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