Almost spanning universality in random graphs

MaRDI QIDQ6621254zbMATH OpenFDO

Authors O. Parczyk

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Almost-spanning universality in random graphs
• Almost-spanning universality in random graphs (extended abstract)
• Spanning universality in random graphs
• Universality of Random Graphs for Graphs of Maximum Degree Two
• Universality of random graphs

Cites work

• Almost-spanning universality in random graphs
• An improved upper bound on the density of universal random graphs
• Embedding large graphs into a random graph
• Embedding spanning trees in random graphs
• Factors in random graphs
• Hamiltonian circuits in random graphs
• How many random edges make a dense graph hamiltonian?
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Introduction to Random Graphs
• On the existence of a factor of degree one of a connected random graph
• Spanning subgraphs of random graphs
• Spanning universality in random graphs
• The longest path in a random graph
• Threshold functions
• Universality of random graphs
• Universality of random graphs and rainbow embedding
• Universality of Random Graphs for Graphs of Maximum Degree Two

This page was built for publication: Almost spanning universality in random graphs

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