Matching and covering the vertices of a random graph by copies of a given graph

DOI10.1016/0012-365X(92)90141-2zbMath0774.05091MaRDI QIDQ1199484

Andrzej Ruciński

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

coveringrandom graphperfect matching

Mathematics Subject Classification ID

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

Related Items (18)

Corrádi and Hajnal's Theorem for Sparse Random Graphs ⋮ Triangles in randomly perturbed graphs ⋮ Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors ⋮ Counting extensions revisited ⋮ On the chromatic number in the stochastic block model ⋮ Cycle Saturation in Random Graphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ On the concentration of the chromatic number of random graphs ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Perfect Matchings in Random r-regular, s-uniform Hypergraphs ⋮ \(H(n)\)-factors in random graphs ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ Universality of random graphs and rainbow embedding ⋮ Tilings in Randomly Perturbed Dense Graphs ⋮ Nonvertex‐Balanced Factors in Random Graphs ⋮ Increasing the flexibility of the herding attack ⋮ Triangle packing and covering in dense random graphs ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Threshold functions
• Threshold functions for extension statements
• Strongly balanced graphs and random graphs
• Threshold functions for small subgraphs
• Tree-Matchings in Graph Processes
• On the existence of a factor of degree one of a connected random graph

This page was built for publication: Matching and covering the vertices of a random graph by copies of a given graph