Adva Mond

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Minimum degree edge-disjoint Hamilton cycles in random directed graphs	2025	Asaf Ferber Adva Mond
+ PDF Chat	The Complexity of Decomposing a Graph into a Matching and a Bounded Linear Forest	2025	Agnijo Banerjee João Pedro Marciano Adva Mond Jan Petr Julien Portier
+ PDF Chat	A note on high-dimensional discrepancy of subtrees	2024	Lawrence Hollom Lyuben Lichev Adva Mond Julien Portier
+ PDF Chat	Discrepancies of spanning trees in dense graphs	2024	Lawrence Hollom Lyuben Lichev Adva Mond Julien Portier
+ PDF Chat	Almost colour-balanced spanning forests in complete graphs	2024	Lawrence Hollom Adva Mond Julien Portier
+	The asymptotic of off-diagonal online Ramsey numbers for paths	2024	Adva Mond Julien Portier
+ PDF Chat	The Maker-Breaker percolation game on a random board	2024	Vojtěch Dvořák Adva Mond Victor Souza
+	$\boldsymbol{H}$-Games Played on Vertex Sets of Random Graphs	2023	Gal Kronenberg Adva Mond Alon Naor
+ PDF Chat	Counting Hamilton Cycles in Dirac Hypergraphs	2023	Asaf Ferber Liam Hardiman Adva Mond
+ PDF Chat	Turán‐type problems for long cycles in random and pseudo‐random graphs	2023	Michael Krivelevich Gal Kronenberg Adva Mond
+	The complexity of decomposing a graph into a matching and a bounded linear forest	2023	Agnijo Banerjee João Pedro Marciano Adva Mond Jan Petr Julien Portier
+	The asymptotic of off-diagonal online Ramsey numbers for paths	2023	Adva Mond Julien Portier
+ PDF Chat	Ternary Egyptian fractions with prime denominator	2022	Adva Mond Julien Portier
+	Ternary Egyptian fractions with prime denominator	2022	Adva Mond Julien Portier
+	Counting Hamiltonian Cycles in Dirac Hypergraphs	2021	Asaf Ferber Liam Hardiman Adva Mond
+	The Maker-Breaker percolation game on the square lattice	2021	Vojtěch Dvořák Adva Mond Victor Souza
+	Counting Hamiltonian Cycles in Dirac Hypergraphs	2021	Asaf Ferber Liam Hardiman Adva Mond
+	On the odd cycle game and connected rules	2020	Jan Corsten Adva Mond Alexey Pokrovskiy Christoph Spiegel Tibor Szabó
+	Tur\'an-type problems for long cycles in random and pseudo-random graphs.	2019	Michael Krivelevich Gal Kronenberg Adva Mond
+ PDF Chat	The minrank of random graphs over arbitrary fields	2019	Noga Alon Igor Balla Lior Gishboliner Adva Mond Frank Mousset
+	On the Odd Cycle Game and Connected Rules	2019	Jan Corsten Adva Mond Alexey Pokrovskiy Christoph Spiegel Tibor Szabó
+	$H$-games played on vertex sets of random graphs	2019	Gal Kronenberg Adva Mond Alon Naor
+	On the Odd Cycle Game and Connected Rules	2019	Jan Corsten Adva Mond Alexey Pokrovskiy Christoph Spiegel Tibor Szabó
+	Turán-type problems for long cycles in random and pseudo-random graphs	2019	Michael Krivelevich Gal Kronenberg Adva Mond
+	The Minrank of Random Graphs over Arbitrary Fields	2018	Noga Alon Igor Balla Lior Gishboliner Adva Mond Frank Mousset
+	The Minrank of Random Graphs over Arbitrary Fields	2018	Noga Alon Igor Balla Lior Gishboliner Adva Mond Frank Mousset

Common Coauthors

Coauthor	Papers Together
Julien Portier	8
Gal Kronenberg	5
Asaf Ferber	4
Jan Corsten	3
Frank Mousset	3
Michael Krivelevich	3
Lawrence Hollom	3
Liam Hardiman	3
Christoph Spiegel	3
Tibor Szabó	3
Alexey Pokrovskiy	3
Noga Alon	3
Lior Gishboliner	3
Igor Balla	3
Victor Souza	2
Alon Naor	2
João Pedro Marciano	2
Vojtěch Dvořák	2
Lyuben Lichev	2
Agnijo Banerjee	2
Jan Petr	1
Julien Portier	1
Jan Petr	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Introduction to Random Graphs	2015	Alan Frieze Michał Karoński	4
+	Picker–Chooser fixed graph games	2016	Małgorzata Bednarska-Bzdȩga Dan Hefetz Tomasz Łuczak	4
+	Positional Games and the Second Moment Method	2002	József Beck	4
+	The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛	2010	Michael Krivelevich	4
+	Avoider–Enforcer games	2006	Dan Hefetz Michael Krivelevich Tibor Szabó	4
+	None	2009	Gruia Călinescu Chandra Chekuri J. Vondrák	3
+	The Sandwich Theorem	1994	Donald E. Knuth	2
+ PDF Chat	On the structure of linear graphs	1946	Paul Erdős A. H. Stone	2
+ PDF Chat	On the number of Hamiltonian cycles in Dirac graphs	2003	Gábor N. Sárközy Stanley M. Selkow Endre Szemerédi	2
+ PDF Chat	Radius, diameter, and minimum degree	1989	P. Erdős János Pach Richard Pollack Zsolt Tuza	2
+	The Induced Size-Ramsey Number of Cycles	1995	Penny Haxell Yoshiharu Kohayakawa Tomasz Łuczak	2
+ PDF Chat	On the Resilience of Long Cycles in Random Graphs	2008	Domingos Dellamonica Yoshiharu Kohayakawa Martin Marciniszyn Angelika Steger	2
+	Waiter–Client and Client–Waiter planarity, colorability and minor games	2016	Dan Hefetz Michael Krivelevich Wei En Tan	2
+	Long paths in sparse random graphs	1982	Béla Bollobás	2
+	On large matchings and cycles in sparse random graphs	1986	Alan Frieze	2
+	Expanding graphs contain all small trees	1987	Joel Friedman Nicholas Pippenger	2
+ PDF Chat	Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees	2011	Klas Markström Andrzej Ruciński	2
+	On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree	2009	Hiệp Hàn Yury Person Mathias Schacht	2
+ PDF Chat	On the diameter of a graph.	1965	J. W. Moon	2
+	Cycles in random graphs	1991	Tomasz Łuczak	2
+	On weight function methods in Chooser–Picker games	2013	Małgorzata Bednarska-Bzdȩga	2
+	The chromatic number of random graphs	1988	B Bollobás	2
+	Planarity, Colorability, and Minor Games	2008	Dan Hefetz Michael Krivelevich Miloš Stojaković Tibor Szabó	2
+	On the number of zero-patterns of a sequence of polynomials	2001	Lajos Rónyai László Babai Murali K. Ganapathy	2
+	Avoider–Enforcer games played on edge disjoint hypergraphs	2013	Asaf Ferber Michael Krivelevich Alon Naor	2
+	Explicit expanders and the Ramanujan conjectures	1986	Alexander Lubotzky Ralph S. Phillips Peter Sarnak	2
+	Random Ramsey graphs for the four-cycle	1994	Zoltán Füredi	2
+	An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth	1998	Yoshiharu Kohayakawa B. Kreuter Angelika Steger	2
+	On maximal paths and circuits of graphs	1959	P. Erdős Т. Галлаи	2
+ PDF Chat	Explicit construction of linear sized tolerant networks	1988	Noga Alon Fan Chung	2
+	Two notions of unit distance graphs	2014	Noga Alon Andrey Kupavskii	2
+	Hamilton ℓ-cycles in uniform hypergraphs	2010	Daniela Kühn Richard Mycroft Deryk Osthus	2
+ PDF Chat	On linear index coding for random graphs	2012	Ishay Haviv Michael Langberg	2
+ PDF Chat	Threshold functions for Ramsey properties	1995	Vojtěch Rödl Andrzej Ruciński	2
+	The size Ramsey number of a directed path	2011	Ido Ben‐Eliezer Michael Krivelevich Benny Sudakov	2
+	Ramsey properties of random graphs	1992	Tomasz Łuczak Andrzej Ruciński Bernd Voigt	2
+ PDF Chat	Fast Strategies In Maker–Breaker Games Played on Random Boards	2012	Dennis Clemens Asaf Ferber Michael Krivelevich Anita Liebenau	2
+	Hamiltonian cycles in Dirac graphs	2009	Bill Cuckler Jeff Kahn	2
+	The longest path in a random graph	1981	Miklós Ajtai János Komlós Endre Szemerédi	2
+ PDF Chat	Keeping Avoider's Graph Almost Acyclic	2015	Dennis Clemens Julia Ehrenmüller Yury Person Tuan Tran	2
+	Turán′s Extremal Problem in Random Graphs: Forbidding Even Cycles	1995	Penny Haxell Yoshiharu Kohayakawa Tomasz Łuczak	2
+	The Shannon Capacity of a Union	1998	Ilan Alon	2
+	Random graphs with monochromatic triangles in every edge coloring	1994	Vojtěch Rödl Andrzej Ruciński	2
+	The Ramsey number for a triple of long even cycles	2006	Agnieszka Figaj Tomasz Łuczak	2
+	Tur�n's extremal problem in random graphs: Forbidding odd cycles	1996	Penny Haxell Yoshiharu Kohayakawa Tomasz Łuczak	2
+	Large triangle-free subgraphs in graphs withoutK 4	1986	Péter Frankl Vojtěch Rödl	2
+	OnK 4-free subgraphs of random graphs	1997	Yoshiharu Kohayakawa Tomasz Łuczak V. Rödl	2
+	Cycles of even length in graphs	1974	J. A. Bondy Miklós Simonovits	2
+	Partitioning edge-coloured complete graphs into monochromatic cycles and paths	2014	Alexey Pokrovskiy	2
+	On the Shannon capacity of a graph	1979	László Lovász	2