(k+1)-Cores Have k-Factors

DOI10.1017/S096354831200034XMaRDI QIDQ3168446zbMATH OpenOpenAlexFDO

Authors

Publication date 31 October 2012

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s096354831200034x

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• One-factors and \(k\)-factors
• Connected \([k,k+1]\)-factors of graphs
• On the defining number of \(K_{2n}\;1\)-factors
• A degree condition for the existence ofk-factors
• scientific article; zbMATH DE number 7448387
• scientific article; zbMATH DE number 1439475
• \(K_{1,3}\)-factors in graphs
• \(k\)-core covers and the core
• scientific article; zbMATH DE number 1150358
• \([a,b]\)-factors containing a given \(k\)-regular subgraph

Cites work

• On the threshold for k-regular subgraphs of random graphs
• Regular subgraphs of random graphs
• Sudden emergence of a giant k-core in a random graph
• The Factors of Graphs

Cited in

(7)

• \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph
• Threshold functions for small subgraphs in simple graphs and multigraphs
• On the threshold for k-regular subgraphs of random graphs
• The property of having a k-regular subgraph has a sharp threshold
• Cores of random graphs are born Hamiltonian
• The first \(k\)-regular subgraph is large
• Regular subgraphs of random graphs

This page was built for publication: (k+1)-Cores Have k-Factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3168446)