(k+1)-Cores Have k-Factors

DOI10.1017/S096354831200034XzbMATH Open1252.05198OpenAlexW2032160258MaRDI QIDQ3168446FDOQ3168446

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph
• On the threshold for \(k\)-regular subgraphs of random graphs
• Regular subgraphs of random graphs
• Cores of random graphs are born Hamiltonian
• The Firstk-Regular Subgraph is Large
• Threshold functions for small subgraphs in simple graphs and multigraphs

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)