Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree

DOI10.1137/17M1133907zbMath1379.05027arXiv1705.08998OpenAlexW2962719113MaRDI QIDQ4602864

António Girão, Kamil Popielarz

Publication date: 7 February 2018

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

Full work available at URL: https://arxiv.org/abs/1705.08998

zbMATH Keywords

induced subgraphmaximum degreerepetition number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (4)

A note on rainbow saturation number of paths ⋮ Large induced subgraphs with three repeated degrees ⋮ Induced subgraphs with many repeated degrees ⋮ Equating two maximum degrees

Cites Work

• Unnamed Item
• Forcing \(k\)-repetitions in degree sequences
• Large induced subgraphs with equated maximum degree
• Repetition number of graphs
• Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
• Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs
• Independent sets and repeated degrees
• Ramsey Problems with Bounded Degree Spread
• Equating two maximum degrees
• Repeated Degrees in Random Uniform Hypergraphs

This page was built for publication: Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree