Induced subgraphs with many repeated degrees
From MaRDI portal
Publication:2305934
DOI10.1016/j.disc.2020.111828zbMath1435.05143arXiv1811.07221OpenAlexW3000835496WikidataQ126292105 ScholiaQ126292105MaRDI QIDQ2305934
Publication date: 20 March 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.07221
Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Forcing \(k\)-repetitions in degree sequences
- Large induced subgraphs with equated maximum degree
- Repetition number of graphs
- Regular induced subgraphs of a random Graph
- Large Nearly Regular Induced Subgraphs
- Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree
- Equating two maximum degrees
- Quasi-random graphs