Nonvertex‐Balanced Factors in Random Graphs

DOI10.1002/jgt.21805zbMath1309.05161arXiv1304.3000OpenAlexW1521523086MaRDI QIDQ4982288

Andrew McDowell, Stefanie Gerke

Publication date: 24 March 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

random graphsdigraphsfactors

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors ⋮ Factors in randomly perturbed hypergraphs ⋮ Tilings in Randomly Perturbed Dense Graphs ⋮ On Komlós’ tiling theorem in random graphs

Cites Work

• Matching and covering the vertices of a random graph by copies of a given graph
• Embedding Spanning Trees in Random Graphs
• Factors in random graphs
• Tree-Matchings in Graph Processes
• Threshold Functions for H-factors
• On the existence of a factor of degree one of a connected random graph

This page was built for publication: Nonvertex‐Balanced Factors in Random Graphs