Factors in random graphs

DOI10.1002/RSA.20224MaRDI QIDQ3522827zbMATH OpenOpenAlexWikidataFDO

Authors Anders Johansson, Van Vu, J. Kahn

Publication date 4 September 2008

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

Full work available at URL https://arxiv.org/abs/0803.3406

zbMATH Keywords

concentration inequalitiesentropyfactormartingalerandom graphsrandom hypergraphsShamir's problem

Mathematics Subject Classification ID

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

Abstract: Let $H$ be a fixed graph on $v$ vertices. For an $n$-vertex graph $G$ with $n$ divisible by $v$, an $H$-{em factor} of $G$ is a collection of $n/v$ copies of $H$ whose vertex sets partition $V(G)$. In this paper we consider the threshold $t{h}_H(n)$ of the property that an ErdH{o}s-R'enyi random graph (on $n$ points) contains an $H$-factor. Our results determine $t{h}_H(n)$ for all strictly balanced $H$. The method here extends with no difficulty to hypergraphs. As a corollary, we obtain the threshold for a perfect matching in random $k$-uniform hypergraph, solving the well-known "Shamir's problem."

Recommendations

• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
• Triangle Factors in Random Graphs
• Threshold Functions for H-factors
• scientific article; zbMATH DE number 3777557
• \(H(n)\)-factors in random graphs

Cites work

• Perfect Matchings in Random r-regular, s-uniform Hypergraphs

Cited in

(85)

• Hamilton -cycles in randomly perturbed hypergraphs
• Maximal planar subgraphs of fixed girth in random graphs
• Embedding spanning bounded degree subgraphs in randomly perturbed graphs
• On offset Hamilton cycles in random hypergraphs
• Thresholds versus fractional expectation-thresholds
• Random perturbation of sparse graphs
• A note on spanning \(K_r\)-cycles in random graphs
• Dirac-type theorems in random hypergraphs
• 2-universality in randomly perturbed graphs
• An analogue of the Erdős-Gallai theorem for random graphs
• Co-degrees resilience for perfect matchings in random hypergraphs
• Spanning trees in random graphs
• Perfect fractional matchings in \(k\)-out hypergraphs
• Triangle resilience of the square of a Hamilton cycle in random graphs
• The threshold bias of the clique-factor game
• Multitrees in random graphs
• Tiling multipartite hypergraphs in quasi-random hypergraphs
• Asymptotics for Shamir's problem
• On the maximum number of Latin transversals
• Rainbow matchings and Hamilton cycles in random graphs
• Universality of random graphs and rainbow embedding
• Corrádi and Hajnal's theorem for sparse random graphs
• Packing Hamilton cycles in random and pseudo-random hypergraphs
• Spanning structures and universality in sparse hypergraphs
• Cycle factors and renewal theory
• Cycles and matchings in randomly perturbed digraphs and hypergraphs
• On spanning structures in random hypergraphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
• scientific article; zbMATH DE number 3777557 (Why is no real title available?)
• Threshold Functions for H-factors
• Triangle Factors in Random Graphs
• Nonvertex-balanced factors in random graphs
• An improved upper bound on the density of universal random graphs
• Pseudorandom hypergraph matchings
• Finding tight Hamilton cycles in random hypergraphs faster
• Maker-Breaker games on randomly perturbed graphs
• Hitting times for Shamir's problem
• The triangle-free process and the Ramsey number \(R(3,k)\)
• Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
• Almost all Steiner triple systems are almost resolvable
• Efficient algorithms for three‐dimensional axial and planar random assignment problems
• Tilings in randomly perturbed dense graphs
• On Komlós' tiling theorem in random graphs
• Optimal threshold for a random graph to be 2-universal
• Tight Hamilton cycles in random hypergraphs
• The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
• On fractional K‐factors of random graphs
• Cycles and matchings in randomly perturbed digraphs and hypergraphs
• Rainbow Hamilton cycles in random graphs
• Triangles in randomly perturbed graphs
• Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
• Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors
• A proof of the Kahn–Kalai conjecture
• Hypercontractivity for global functions and sharp thresholds
• Random triangles in random graphs
• Factors in randomly perturbed hypergraphs
• Weak saturation stability
• On the chromatic number in the stochastic block model
• FF‐factors in Quasi‐random Hypergraphs
• Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
• Cycle Saturation in Random Graphs
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
• Threshold for Steiner triple systems
• On the concentration of the chromatic number of random graphs
• The hitting time of clique factors
• The square of a Hamilton cycle in randomly perturbed graphs
• Optimal spread for spanning subgraphs of Dirac hypergraphs
• Almost spanning universality in random graphs
• A smoother notion of spread hypergraphs
• Spanning F-cycles in random graphs
• A robust Corrádi-Hajnal theorem
• A note on non-isomorphic edge-color classes in random graphs
• Searching for (sharp) thresholds in random structures: where are we now?
• Powers of Hamilton cycles in pseudorandom graphs
• Vertex-critical graphs far from edge-criticality
• Color-bias perfect matchings in hypergraphs
• Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model
• The hitting time of clique factors (extended abstract)
• Minimal H-factors and covers
• Clique factors in pseudorandom graphs
• Universality for graphs of bounded degeneracy
• Tiling random regular graphs efficiently
• Increasing the flexibility of the herding attack
• \(H(n)\)-factors in random graphs

This page was built for publication: Factors in random graphs

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