Factors in random graphs
From MaRDI portal
Publication:3522827
DOI10.1002/rsa.20224zbMath1146.05040arXiv0803.3406WikidataQ56503927 ScholiaQ56503927MaRDI QIDQ3522827
Anders Johansson, Van H. Vu, Jeffry Kahn
Publication date: 4 September 2008
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.3406
entropy; random graphs; martingale; factor; concentration inequalities; random hypergraphs; Shamir's problem
05C80: Random graphs (graph-theoretic aspects)
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Finding tight Hamilton cycles in random hypergraphs faster, Nonvertex‐Balanced Factors in Random Graphs, An improved upper bound on the density of universal random graphs, Pseudorandom hypergraph matchings, Maker-Breaker Games on Randomly Perturbed Graphs, Hitting times for Shamir’s problem, The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘), 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, 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, F$F$‐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 maximum number of Latin transversals, Cycles and matchings in randomly perturbed digraphs and hypergraphs, On spanning structures in random hypergraphs, Powers of Hamilton cycles in pseudorandom graphs, Increasing the flexibility of the herding attack, Hamilton \(\ell\)-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, 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, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
Cites Work
