Connected balanced subgraphs in random regular multigraphs under the configuration model

MaRDI QIDQ2866563zbMATH OpenFDO

Authors Linyuan Lu, Austin Mohr, László A. Székely

Publication date 13 December 2013

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

enumeration of regular graphsLovász local lemmarandom matchings

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 4041966
• scientific article; zbMATH DE number 3889584
• scientific article; zbMATH DE number 3865331
• scientific article; zbMATH DE number 701118
• scientific article; zbMATH DE number 568785
• Strongly balanced graphs and random graphs
• Regular subgraphs of random graphs
• On the hardness of the Balanced Connected Subgraph Problem for families of Regular Graphs
• Distribution of subgraphs of random regular graphs

Cited in

(3)

• scientific article; zbMATH DE number 3865331 (Why is no real title available?)
• scientific article; zbMATH DE number 4041966 (Why is no real title available?)
• scientific article; zbMATH DE number 701118 (Why is no real title available?)

This page was built for publication: Connected balanced subgraphs in random regular multigraphs under the configuration model

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