Tiling random regular graphs efficiently

DOI10.4230/LIPICS.ICALP.2025.70MaRDI QIDQ7363151zbMATH OpenFDO

Authors Sahar Diskin, Ilay Hoshen, M. E. Zhukovskii

Publication date 29 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.70

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• 3-star factors in random d-regular graphs
• A constructive proof of the general Lovász local lemma
• Almost all regular graphs are hamiltonian
• Factors in random graphs
• High degree graphs contain large-star factors
• scientific article; zbMATH DE number 3769673 (Why is no real title available?)
• scientific article; zbMATH DE number 3773632 (Why is no real title available?)
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 486633 (Why is no real title available?)
• Matching and covering the vertices of a random graph by copies of a given graph
• Maximum flow and minimum-cost flow in almost-linear time
• On the existence of a factor of degree one of a connected random graph
• Pseudo-random graphs
• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Random triangles in random graphs
• Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
• The asymptotic distribution of short cycles in random regular graphs
• The hitting time of clique factors
• The number of trees
• Threshold Functions for H-factors
• Tree-Matchings in Graph Processes

This page was built for publication: Tiling random regular graphs efficiently

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