The hitting time of clique factors
From MaRDI portal
Publication:6596384
DOI10.1002/RSA.21218zbMATH Open1546.05104MaRDI QIDQ6596384FDOQ6596384
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)
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Percolation
- Title not available (Why is that?)
- On the combinatorial problems which I would most like to see solved
- Factors in random graphs
- Perfect matchings in random uniform hypergraphs
- Perfect matchings in random s‐uniform hypergraphs
- Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
- Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
- The phase transition in random regular exact cover
- Title not available (Why is that?)
- Loose Hamilton cycles in random uniform hypergraphs
- On the existence of a factor of degree one of a connected random graph
- Random triangles in random graphs
- Triangle Factors in Random Graphs
- Matching and covering the vertices of a random graph by copies of a given graph
- Threshold Functions for H-factors
- The phase transition in exact cover
- A threshold for perfect matchings in random d-pure hypergraphs
- The theory of regular graphs
- On the strength of connectedness of a random hypergraph
- Perfect fractional matchings in \(k\)-out hypergraphs
- Hitting times for Shamir's problem
- Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
- Satisfiability thresholds for regular occupation problems
Cited In (1)
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)
