Large induced subgraphs with equated maximum degree

DOI10.1016/j.disc.2009.09.003zbMath1214.05054OpenAlexW2071691924MaRDI QIDQ965950

Raphael Yuster, Yair Caro

Publication date: 27 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.09.003

zbMATH Keywords

induced subgraphmaximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (7)

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 ⋮ Twins in graphs ⋮ Induced subgraphs with many repeated degrees ⋮ Equating two maximum degrees

Cites Work

• Repetition number of graphs
• Large disjoint subgraphs with the same order and size
• Independent sets and repeated degrees
• Degree multiplicities and independent sets in \(K_ 4\)-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Large induced subgraphs with equated maximum degree