Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph

DOI10.1016/j.ejc.2024.103940arXiv2108.07601MaRDI QIDQ6201923

Olaf Parczyk, Max Hahn-Klimroth, Yury Person

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(r\)-connected spanning subgraphoptimal minimum degree condition

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• Embedding large subgraphs into dense graphs
• On the square of a Hamiltonian cycle in dense graphs
• On the maximal number of independent circuits in a graph
• Some Theorems on Abstract Graphs
• Good acyclic orientations of 4‐regular 4‐connected graphs

This page was built for publication: Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph