Minimum degree conditions for containing an r-regular r-connected spanning subgraph
From MaRDI portal
(Redirected from Minimum degree conditions for containing an r-regular r-connected spanning subgraph)
Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph
Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph
Abstract: We study optimal minimum degree conditions when an -vertex graph contains an -regular -connected subgraph. We prove for fixed and large the condition to be when . This answers a question of M.~Kriesell.
Recommendations
Cites work
- Blow-up lemma
- Embedding large subgraphs into dense graphs
- Good acyclic orientations of 4‐regular 4‐connected graphs
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- On the maximal number of independent circuits in a graph
- On the square of a Hamiltonian cycle in dense graphs
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Proof of the Seymour conjecture for large graphs
- Some Theorems on Abstract Graphs
This page was built for publication: Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201923)