Forcing \(k\)-repetitions in degree sequences
From MaRDI portal
Publication:405103
zbMath1300.05064arXiv1312.1213MaRDI QIDQ405103
Asaf Shapira, Yair Caro, Raphael Yuster
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1213
Related Items
Equating \(\kappa\) maximum degrees in graphs without short cycles ⋮ Large induced subgraphs with three repeated degrees ⋮ Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree ⋮ A note on repeated degrees of line graphs ⋮ Induced subgraphs with many repeated degrees ⋮ Equating two maximum degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Small Ramsey numbers
- Degree multiplicities and independent sets in \(K_ 4\)-free graphs
- Bounding the weight choosability number of a graph
- A New Upper Bound for the Irregularity Strength of Graphs
- Ramsey Problems with Bounded Degree Spread
- Repeated Degrees in Random Uniform Hypergraphs
