Degree multiplicities and independent sets in K_ 4-free graphs

DOI10.1016/0012-365X(95)00002-EzbMATH Open0858.05056OpenAlexW2147283108MaRDI QIDQ1815307FDOQ1815307

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Theory and Probability
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• On a Ramsey-Turán type problem
• Degree sequences in triangle-free graphs

Cited In (9)

• Forcing \(k\)-repetitions in degree sequences
• Equating two maximum degrees
• Large induced subgraphs with equated maximum degree
• On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
• Further Improvement on Maximum Independent Set in Degree-4 Graphs
• Lower bounds on size and independence inK4-free graphs
• Independent sets in \((P_4+P_4\),triangle)-free graphs
• Large induced subgraphs with three repeated degrees
• Degree sequence and independence in \(K(4)\)-free graphs

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

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