Large induced subgraphs with three repeated degrees
From MaRDI portal
Publication:2689512
DOI10.1016/j.disc.2023.113344OpenAlexW4318476702MaRDI QIDQ2689512
Gaoxing Sun, Qinghou Zeng, Jian-Feng Hou
Publication date: 10 March 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113344
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Regular independent sets
- Forcing \(k\)-repetitions in degree sequences
- Large induced subgraphs with equated maximum degree
- Repetition number of graphs
- Degree sequences in triangle-free graphs
- Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs
- Independent sets and repeated degrees
- Degree multiplicities and independent sets in \(K_ 4\)-free graphs
- Degree sequence and independence in \(K(4)\)-free graphs
- Equating \(\kappa\) maximum degrees in graphs without short cycles
- Induced subgraphs with many repeated degrees
- Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree
- Equating two maximum degrees
- Repeated Degrees in Random Uniform Hypergraphs
- Extremal Numbers for Odd Cycles
- Notes on Spreads of Degrees in Graphs
This page was built for publication: Large induced subgraphs with three repeated degrees