Surveys in Combinatorics 2017

- Print publication year: 2017
- Online publication date: July 2017

- Publisher: Cambridge University Press
- https://doi.org/10.1017/9781108332699.009
- pp 372-408

Recommend this book

Email your librarian or administrator to recommend adding this book to your organisation's collection.

Surveys in Combinatorics 2017

[1] Multicoloured Hamilton cycles. Electron. J. Combin.
2, R10. , , and ,

[2] , , and , The bandwidth theorem in sparse graphs, preprint.

[3] The maximum number of Hamiltonian paths in tournaments, Combinatorica
10 (1990), 319–324. ,

[4] Properly colored Hamilton cycles in edgecolored complete graphs, Random Struct. Algor.
11 (1997), 179–186. and ,

[5] Increasing the chromatic number of a random graph, Journal of Combinatorics
1 (2010), 345–356. and ,

[6] Local resilience of almost spanning trees in random graphs, Random Structures and Algorithms
38 (2011), 121–139. , and ,

[7] Corrádi and Hajnal's theorem for sparse random graphs, Combin. Probab. Comput.
21 (2012), 23–55. , and ,

[8] Combinatorial Games, Cambridge University Press, Cambridge (2008). ,

[9] Hitting time results for Maker-Breaker games, Random Structures and Algorithms
41 (2012), 23–46. , , and ,

[10] On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs, SIAM J. Discrete Math.
25 (2011), 1176–1193. , and ,

[11] Local resilience and Hamiltonicity Maker-Breaker games in random regular graphs, Combinatorics, Probability and Computing
20 (2011), 173–211. , and ,

[12] in Graph Theory and Combinatorics, Academic Press, New York (1984), 35–57. , The evolution of sparse graphs,

[13] The chromatic number of random graphs, Combinatorica
8 (1988), 49–55. ,

[14] Random Graphs, 2nd ed., Cambridge University Press, Cambridge (2001). ,

[15] Alternating hamiltonian cycles, Israel J. Math.
23 (1976), 126–131. and ,

[16] Random graphs ‘83, North-Holland Math. Stud. 118, North-Holland, Amsterdam, 1985, 23–46. and , On matchings and Hamiltonian cycles in random graphs, in:

[17] Handbook of Combinatorics Vol. 1 (ed. by , and ), North-Holland, Amsterdam, 1995, 3–110. , Basic Graph Theory: Paths and Circuits, in:

[18] Almost spanning subgraphs of random graphs after adversarial edge removal, Combinatorics, Probability and Computing
22 (2013), 639–683. , and ,

[19] Some properties of non-negative matrices and their permanents, Sov. Mat. Dokl.
14 (1973), 945–949. ,

[20] Graphs with Hamiltonian cycles having adjacent lines different colors, J. Combin. Theory Ser. B
21 (1976), 135–139. and ,

[21] Biased positional games, Annals of Discrete Math.
2 (1978), 221–228. and ,

[22] Combinatorial theorems in sparse random sets, Annals of Math.
184 (2016), 367–454. and ,

[23] Proof of the 1-factorization and Hamilton decomposition conjectures, Memoirs of the American Mathematical Society
244 (2016), monograph 1154, 170 pages. , , , and ,

[24] Hamilton cycles in regular tournaments, Combinatorics, Probability and Computing
16 (2007), 239–249. ,

[25] Hamiltonian cycles in Dirac graphs, Combinatorica
29 (2009), 299–326. and ,

[26] Graphs with cycles having adjacent lines different colors, J. Combin. Theory Ser. B
20 (1976), 149–152. ,

[27] Graph theory, 3rd ed., Springer-Verlag, Berlin, 2005. ,

[28] On the resilience of long cycles in random graphs, Electronic J. Combin.
15 (2008), R32. , , and ,

[29] The solution of the Van der Waerden problem for permanents, Dokl. Akad. Nauk SSSR
258 (1981), 1041–1044. ,

[30] On some problems related to partitions of edges of a graph, in: Graphs and other combinatorial topics (Prague, 1982), Teubner-Texte Math.
59, Teubner, Leipzig, 1983, 54– 63. , and ,

[31] On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl.
5 (1960), 17–61. and ,

[32] Asymmetric graphs, Acta Math. Acad. Sci. Hung.
14 (1963), 295–315. and ,

[33] On the existence of a factor of degree one of a connected random graph, Acta Math. Acad. Sci. Hungar.
17 (1966), 359–368. and ,

[34] Infinite and finite sets, Vol. 11, edited by , and , Colloq. Math. Soc. János Bolyai 10, North-Holland, Amsterdam (1975), 633–643. , and , Anti-Ramsey theorems, in:

[35] A proof of the Van derWaerden problem for permanents of a doubly stochastic matrix, Mat. Zametki
29 (1981), 931–938. ,

[36] Biased games on random boards, Random Structures and Algorithms
46 (2015), 651– 676. , , and ,

[37] Generating random graphs in biased maker-breaker games
Random Structures Algorithms
47 (2015), 615–634. , and ,

[38] , and , Counting and packing Hamilton cycles in dense graphs and oriented graphs, J. Combinatorial Theory Ser. B, to appear.

[39] , and , Packing, Counting and Covering Hamilton cycles in random directed graphs, Israel J. Mathematics, to appear.

[40] , and , Counting Hamiltonian decompositions of oriented graphs, arXiv:1609.09550.

[41] Proceedings of 26th ACMSIAM SODA, ACM Press (2015), 1752–1758. , , , and , Robust hamiltonicity of random directed graphs,

[42] Introduction to Random Graphs, Cambridge University Press, 2016. and ,

[43] On packing Hamilton cycles in ε-regular graphs, J. Combinatorial Theory Ser. B
94 (2005), 159–172. and ,

[44] On two Hamilton cycle problems in random graphs, Israel J. of Mathematics
166 (2008), 221–234. and ,

[45] On the number of Hamilton cycles in sparse random graphs, SIAM Journal on Discrete Math.
27 (2013), 27–42. and ,

[46] , and , The number of Hamiltonian decompositions of regular graphs, Israel J. of Mathematics, to appear.

[47] , and , The threshold probability for long cycles, Combinatorics, Probability and Computing, to appear.

[48] Hamilton cycles in oriented graphs, Combinatorics, Probability and Computing
2 (1993), 25–32. ,

[49] Positional Games, Birkhäuser
Basel, 2014. , , and ,

[50] Random directed graphs are robustly Hamiltonian, Random Structures and Algorithms
49 (2016), 345–362. , and ,

[51] Bandwidth theorem for random graphs, J. Combin. Theory Ser. B
102 (2012), 14–37. , and ,

[52] Random graphs, Wiley, New York, 2000. , and ,

[53] Complexity of Computer Computations, New York: Plenum (1972), 85–103. , Reducibility among combinatorial problems, in:

[54] Minimum degree of a graph and the existence of kfactors, Proc. Indian Acad. Sci. Math. Sci.
94 (1985), 123–127. ,

[55] An exact minimum degree condition for Hamilton cycles in oriented graphs, J. London Math. Soc.
79 (2009), 144–166. , and ,

[56] On asymmetry of random graphs and random regular graphs, Random Structures and Algorithms
21 (2002), 216–224. , and ,

[57] Edge-disjoint Hamilton cycles in random graphs, Random Structures and Algorithms
46 (2015), 397– 445. , and ,

[58] Combinatorics, Paul Erdʺos is eighty, Vol. 2, Bolyai Soc. Math. Stud. 2, Budapest, 1996, 295–352. and , Szemerédi's regularity lemma and its applications in graph theory, in

[59] Limit distribution for the existence of Hamiltonian cycles in a random graph, Discrete Mathematics
43 (1983), 55–63. and ,

[60] Solution of a problem of Erdʺos and Rényi on Hamilton cycles in non-oriented graphs, Soviet Math. Dokl, 17 (1976), 760–764. ,

[61] Moves without forbidden transitions in a graph, Matematickỳ Časopis
18 (1968), 76–80. ,

[62] The critical bias for the Hamiltonicity game is (1 + o(1))n/ ln n, Journal of the American Mathematical Society
24 (2011), 125–131. ,

[63] Resilient pancyclicity of random and pseudorandom graphs, SIAM J. Discrete Math.
24 (2010), 1–16. , and ,

[64] Robust Hamiltonicity of Dirac graphs, Transactions of the Amer. Math. Soc.
366 (2014), 3095–3130. , and ,

[65] Long paths and cycles in random subgraphs of graphs with large minimum degree, Random Structures and Algorithms
46 (2015), 320–345. , and ,

[66] Compatible Hamilton cycles in random graphs, Random Structures and Algorithms
49 (2016), 533– 557. , and ,

[67] , and , Compatible Hamilton cycles in Dirac graphs, Combinatorica, to appear.

[68] Optimal packings of Hamilton cycles in sparse random graphs, SIAM J. Discrete Mathematics
26 (2012), 964–982. and ,

[69] Sparse pseudo-random graphs are Hamiltonian, J. Graph Theory
42 (2003), 17–33. and ,

[70] More Sets, Graphs and Numbers, Bolyai Society Mathematical Studies 15, Springer, 2006, 199–262. and , Pseudo-random graphs, in:

[71] Random regular graphs of high degree, Random Structures and Algorithms
18 (2001), 346–363. , , and ,

[72] On the probability of independent sets in random graphs, Random Structures and Algorithms
22 (2003), 1–14. , , and ,

[73] Optimal packings of Hamilton cycles in graphs of high minimum degree, Combinatorics, Probability, Computing
22 (2013), 394–416. , and ,

[74] Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments, Advances in Mathematics
237 (2013), 62–146. and ,

[75] Hamilton decompositions of regular expanders: applications, J. Combinatorial Theory Series B
104 (2014), 1–27. and ,

[76] Hamilton decompositions of regular tournaments, Proceedings of the London Mathematical Society
101 (2010), 303–335. , and ,

[77] Dirac's theorem for random graphs, Random Structures and Algorithms
41 (2012), 293–305. and ,

[78] , Properly coloured Hamiltonian cycles in edge-coloured complete graphs, Combinatorica, to appear.

[79] Combinatorial problems and exercises, 2nd edition, AMS Chelsea Publishing, 2007. ,

[80] The chromatic number of random graphs, Combinatorica
11 (1991), 45–54. ,

[81] Combinatorial Theory and Its Applications, III, North-Holland, 1970, 813–819. , Hamiltonian lines in graphs whose vertices have sufficiently large valencies, in:

[82] Studies in Pure Mathematics, Academic Press, London, 1971, 157–183. , Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency, in:

[83] and , Local resilience for squares of almost spanning cycles in sparse random graphs, preprint.

[84] Hamiltonian circuits in random graphs, Discrete Mathematics, 14 (1976), 359–364. ,

[85] Infinite and finite sets, Vol. 11, edited by , and , Colloq. Math. Soc. János Bolyai 10, North-Holland, Amsterdam (1975), 1159–1168. , Anti-Ramsey theorems, in:

[86] Long cycles in random subgraphs of graphs with large minimum degree
Random Structures and Algorithms
45 (2014), 764– 767. ,

[87] Almost all regular graphs are Hamiltonian
Random Structures and Algorithms
5 (1994), 363–374. , and ,

[88] On the number of Hamiltonian cycles in Dirac graphs, Discrete Math.
265 (2003), 237–250. , and ,

[89] Extremal results for random discrete structures, Annals of Math.
184 (2016), 333–365. ,

[90] Local resilience of graphs, Random Structures and Algorithms
33 (2008), 409–433. and ,

[91] Kombinatorikai vizsgalatok az iranyitott teljes graffal, Mt. Fiz. Lapok
50 (1943), 223–256. ,

[92] Surveys in Combinatorics ( ed.), London Math. Soc. Lecture Notes 38, Cambridge University Press, 1979, 211–228. , Long cycles in digraphs with constraints on the degrees, in:

[93] Hamilton circuits in regular tournaments, Annals of Discrete Math.
27 (1985), 159–162. ,

[94] Surveys in Combinatorics, Cambridge University Press, 1999, 239–298. , Models of random regular graphs, in: