Decomposing almost complete graphs by random trees

Anna Lladó

Type: Preprint

Publication Date: 2015-12-01

Citations: 0

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Decomposing almost complete graphs by random trees	2015	Anna Lladó
+ PDF Chat	Decomposing almost complete graphs by random trees	2017	Anna Lladó
+ PDF Chat	Decomposing almost complete graphs by random trees	2014	Anna Lladó
+	Ringel's tree packing conjecture in quasirandom graphs	2020	Peter Keevash Katherine Staden
+ PDF Chat	Almost Every Tree With <i>m</i> Edges Decomposes <i>K</i><sub>2<i>m</i>,2<i>m</i></sub>	2013	Michael Drmota Anna Lladó
+ PDF Chat	Families of Trees Decompose the Random Graph in an Arbitrary Way	2004	Raphael Yuster
+	On a conjecture of Graham and Häggkvist for random trees	2013	Michael Drmota Anna Lladó
+	Bipartite decomposition of random graphs	2014	Noga Alon
+	Bipartite decomposition of random graphs	2014	Noga Alon
+	Decomposing a Complete Graph: The Graham–Pollak Theorem – Take One	2022
+	Families of trees decompose the random graph in any arbitrary way	2002	Raphael Yuster
+ PDF Chat	Decomposition of Random Graphs into Complete Bipartite Graphs	2016	Fan Chung Xing Peng
+	Decomposition of random graphs into complete bipartite graphs	2014	Fan Chung Xing Peng
+	A proof of Ringel's Conjecture	2020	Richard Montgomery Alexey Pokrovskiy Benny Sudakov
+	A proof of Ringel's Conjecture	2020	Richard Montgomery Alexey Pokrovskiy Benny Sudakov
+	Random 4-regular graphs have 3-star decompositions asymptotically almost surely	2016	Michelle Delcourt Luke Postle
+	Random 4-regular graphs have 3-star decompositions asymptotically almost surely	2016	Michelle Delcourt Luke Postle
+	More on the bipartite decomposition of random graphs	2014	Noga Alon Tom Bohman Hao Huang
+ PDF Chat	Decomposing Graphs into Edges and Triangles	2019	Daniel Kráľ Bernard Lidický Táısa Martins Yanitsa Pehova
+	Random 4-regular graphs have 3-star decompositions asymptotically almost surely	2018	Michelle Delcourt Luke Postle

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (10)

Action	Title	Year	Authors
+ PDF Chat	An approximate version of the tree packing conjecture	2016	Julia Böttcher Jan Hladký Diana Piguet Anusch Taraz
+	Packing and Decomposition of Graphs with Trees	2000	Raphael Yuster
+	The distribution of nodes of given degree in random trees	1999	Michael Drmota Bernhard Gittenberger
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>ρ</mml:mi></mml:math>-Valuations for some stunted trees	2006	André E. Kézdy
+ PDF Chat	The shape of unlabeled rooted random trees	2010	Michael Drmota Bernhard Gittenberger
+	On a conjecture of Graham and Häggkvist with the polynomial method	2009	M. Cámara Anna Lladó J. Moragas
+	The distribution of degrees in a large random tree	1975	Robert W. Robinson Allen J. Schwenk
+	Distinct Sums Modulo <i>n</i> and Tree Embeddings	2002	André E. Kézdy Hunter S. Snevily
+ PDF Chat	Almost Every Tree With <i>m</i> Edges Decomposes <i>K</i><sub>2<i>m</i>,2<i>m</i></sub>	2013	Michael Drmota Anna Lladó
+	Decompositions of complete bipartite graphs	1989	Roland Häggkvist