Universality of random graphs and rainbow embedding

Asaf Ferber, Rajko Nenadov, Ueli Peter

Type: Preprint

Publication Date: 2013-11-27

Citations: 4

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Universality of random graphs and rainbow embedding	2013	Asaf Ferber Rajko Nenadov Ueli Peter
+	Spanning universality in random graphs	2017	Asaf Ferber Rajko Nenadov
+	Spanning universality in random graphs	2017	Asaf Ferber Rajko Nenadov
+	Spanning structures and universality in sparse hypergraphs	2015	Olaf Parczyk Yury Person
+	Spanning structures and universality in sparse hypergraphs	2015	Olaf Parczyk Yury Person
+	Rainbow spanning trees in random subgraphs of dense regular graphs	2021	Peter Bradshaw
+ PDF Chat	Universality of random graphs and rainbow embedding	2015	Asaf Ferber Rajko Nenadov Ueli Peter
+	Packing a randomly edge-colored random graph with rainbow $k$-outs	2014	Asaf Ferber Gal Kronenberg Frank Mousset Clara Shikhelman
+ PDF Chat	Embedding Spanning Trees in Random Graphs	2010	Michael Krivelevich
+	Rainbow spanning trees in random edge-colored graphs.	2021	Peter Bradshaw
+	Rainbow Hamilton cycles in random graphs and hypergraphs	2015	Asaf Ferber Michael Krivelevich
+ PDF Chat	Rainbow Hamilton cycles in random graphs and hypergraphs	2016	Asaf Ferber Michael Krivelevich
+ PDF Chat	Spanning universality in random graphs	2018	Asaf Ferber Rajko Nenadov
+	Rainbow spanning trees in random subgraphs of dense regular graphs	2024	Peter Bradshaw
+	A rainbow connectivity threshold for random graph families	2021	Peter Bradshaw Bojan Mohar
+ PDF Chat	Embedding large graphs into a random graph	2017	Asaf Ferber Kyle Luh Hoi H. Nguyen
+	Embedding spanning structures in graphs and hypergraphs	2013	Fiachra Knox
+	Rainbow trees in uniformly edge-coloured graphs	2021	Elad Aigner‐Horev Dan Hefetz A. Lahiri
+	A rainbow blow-up lemma for almost optimally bounded edge-colourings	2019	Stefan Ehard Stefan Glock Felix Joos
+	A rainbow blow-up lemma for almost optimally bounded edge-colourings	2019	Stefan Ehard Stefan Glock Felix Joos

Works That Cite This (4)

Action	Title	Year	Authors
+	Rainbow perfect matchings and Hamilton cycles in the random geometric graph	2016	Deepak Bal Patrick Bennett Xavier Pérez‐Giménez Paweł Prałat
+ PDF Chat	Rainbow perfect matchings and Hamilton cycles in the random geometric graph	2017	Deepak Bal Patrick Bennett Xavier Pérez‐Giménez Paweł Prałat
+	Embedding bounded degree spanning trees in random graphs	2014	Richard Montgomery
+	Packing a randomly edge-colored random graph with rainbow $k$-outs	2014	Asaf Ferber Gal Kronenberg Frank Mousset Clara Shikhelman

Works Cited by This (15)

Action	Title	Year	Authors
+	An improved upper bound on the density of universal random graphs	2014	Domingos Dellamonica Yoshiharu Kohayakawa Vojtěch Rödl Andrzej Ruciński
+	Local resilience of almost spanning trees in random graphs	2010	József Balogh Béla Csaba Wojciech Samotij
+	On Universal Graphs for Spanning Trees	1983	Fan Chung Ronald Graham
+	Spanning subgraphs of random graphs	1992	Noga Alon Zoltán Füredi
+ PDF Chat	Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs	2002	Colin Cooper Alan Frieze
+	Matchings in random regular bipartite digraphs	1980	David W. Walkup
+	None	2011	J.L. Rami ́rez Alfonsi ́n Sándor Z. Kiss Imre Z. Ruzsa Carlos Vinuesa
+ PDF Chat	Universal Graphs for Bounded-Degree Trees and Planar Graphs	1989	Sandeep Bhatt Fan Chung Frank Thomson Leighton Arnold L. Rosenberg
+ PDF Chat	Embedding nearly-spanning bounded degree trees	2007	Noga Alon Michael Krivelevich Benny Sudakov
+ PDF Chat	Large Bounded Degree Trees in Expanding Graphs	2010	József Balogh Béla Csaba Martin Pei Wojciech Samotij