The hitting time of clique factors

DOI10.1002/RSA.21218MaRDI QIDQ6596384zbMATH OpenFDO

Authors Annika Heckel, Marc Kaufmann, Noela Müller, Matija Pasch

Publication date 2 September 2024

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

hitting timehypergraphsperfect matchingrandom graphsclique factor

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
• Hitting times for Shamir's problem
• Factors in random graphs
• Asymptotics for Shamir's problem

Cites work

• scientific article; zbMATH DE number 3943863 (Why is no real title available?)
• scientific article; zbMATH DE number 1131467 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• A threshold for perfect matchings in random d-pure hypergraphs
• Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
• Factors in random graphs
• Hitting times for Shamir's problem
• Loose Hamilton cycles in random uniform hypergraphs
• Matching and covering the vertices of a random graph by copies of a given graph
• On the combinatorial problems which I would most like to see solved
• On the existence of a factor of degree one of a connected random graph
• On the strength of connectedness of a random hypergraph
• Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
• Percolation
• Perfect fractional matchings in \(k\)-out hypergraphs
• Perfect matchings in random s‐uniform hypergraphs
• Perfect matchings in random uniform hypergraphs
• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
• Random triangles in random graphs
• Satisfiability thresholds for regular occupation problems
• The phase transition in exact cover
• The phase transition in random regular exact cover
• The theory of regular graphs
• Threshold Functions for H-factors
• Triangle Factors in Random Graphs

Cited in

(1)

• Searching for (sharp) thresholds in random structures: where are we now?

This page was built for publication: The hitting time of clique factors

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