Book contents
- Frontmatter
- Contents
- Preface
- 1 Relations among partitions
- 2 Large-scale structures in random graphs
- 3 The spt-function of Andrews
- 4 Combinatorial structures in finite classical polar spaces
- 5 Switching techniques for edge decompositions of graphs
- 6 Ramsey-type and amalgamation-type properties of permutations
- 7 Monotone cellular automata
- 8 Robustness of graph properties
- 9 Some applications of relative entropy in additive combinatorics
- References
8 - Robustness of graph properties
Published online by Cambridge University Press: 21 July 2017
Book contents
- Frontmatter
- Contents
- Preface
- 1 Relations among partitions
- 2 Large-scale structures in random graphs
- 3 The spt-function of Andrews
- 4 Combinatorial structures in finite classical polar spaces
- 5 Switching techniques for edge decompositions of graphs
- 6 Ramsey-type and amalgamation-type properties of permutations
- 7 Monotone cellular automata
- 8 Robustness of graph properties
- 9 Some applications of relative entropy in additive combinatorics
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Surveys in Combinatorics 2017 , pp. 372 - 408Publisher: Cambridge University PressPrint publication year: 2017
References
[1] , , and , Multicoloured Hamilton cycles. Electron. J. Combin.
2, R10.
[2] , , and , The bandwidth theorem in sparse graphs, preprint.
[3] , The maximum number of Hamiltonian paths in tournaments, Combinatorica
10 (1990), 319–324.Google Scholar
[4] and , Properly colored Hamilton cycles in edgecolored complete graphs, Random Struct. Algor.
11 (1997), 179–186.Google Scholar
[5] and , Increasing the chromatic number of a random graph, Journal of Combinatorics
1 (2010), 345–356.Google Scholar
[6] , and , Local resilience of almost spanning trees in random graphs, Random Structures and Algorithms
38 (2011), 121–139.Google Scholar
[7] , and , Corrádi and Hajnal's theorem for sparse random graphs, Combin. Probab. Comput.
21 (2012), 23–55.Google Scholar
[8] , Combinatorial Games, Cambridge University Press, Cambridge (2008).
[9] , , and , Hitting time results for Maker-Breaker games, Random Structures and Algorithms
41 (2012), 23–46.Google Scholar
[10] , and , On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs, SIAM J. Discrete Math.
25 (2011), 1176–1193.Google Scholar
[11] , and , Local resilience and Hamiltonicity Maker-Breaker games in random regular graphs, Combinatorics, Probability and Computing
20 (2011), 173–211.Google Scholar
[12] , The evolution of sparse graphs, in Graph Theory and Combinatorics, Academic Press, New York (1984), 35–57.
[14] , Random Graphs, 2nd ed., Cambridge University Press, Cambridge (2001).
[16] and , On matchings and Hamiltonian cycles in random graphs, in: Random graphs ‘83, North-Holland Math. Stud. 118, North-Holland, Amsterdam, 1985, 23–46.
[17] , Basic Graph Theory: Paths and Circuits, in: Handbook of Combinatorics Vol. 1 (ed. by , and ), North-Holland, Amsterdam, 1995, 3–110.
[18] , and , Almost spanning subgraphs of random graphs after adversarial edge removal, Combinatorics, Probability and Computing
22 (2013), 639–683.Google Scholar
[19] , Some properties of non-negative matrices and their permanents, Sov. Mat. Dokl.
14 (1973), 945–949.Google Scholar
[20] and , Graphs with Hamiltonian cycles having adjacent lines different colors, J. Combin. Theory Ser. B
21 (1976), 135–139.Google Scholar
[22] and , Combinatorial theorems in sparse random sets, Annals of Math.
184 (2016), 367–454.Google Scholar
[23] , , , and , Proof of the 1-factorization and Hamilton decomposition conjectures, Memoirs of the American Mathematical Society
244 (2016), monograph 1154, 170 pages.Google Scholar
[24] , Hamilton cycles in regular tournaments, Combinatorics, Probability and Computing
16 (2007), 239–249.Google Scholar
[26] , Graphs with cycles having adjacent lines different colors, J. Combin. Theory Ser. B
20 (1976), 149–152.Google Scholar
[27] , Graph theory, 3rd ed., Springer-Verlag, Berlin, 2005.
[28] , , and , On the resilience of long cycles in random graphs, Electronic J. Combin.
15 (2008), R32.Google Scholar
[29] , The solution of the Van der Waerden problem for permanents, Dokl. Akad. Nauk SSSR
258 (1981), 1041–1044.Google Scholar
[30] , and , 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.
[31] and , On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl.
5 (1960), 17–61.Google Scholar
[33] and , On the existence of a factor of degree one of a connected random graph, Acta Math. Acad. Sci. Hungar.
17 (1966), 359–368.Google Scholar
[34] , and , Anti-Ramsey theorems, in: Infinite and finite sets, Vol. 11, edited by , and , Colloq. Math. Soc. János Bolyai 10, North-Holland, Amsterdam (1975), 633–643.
[35] , A proof of the Van derWaerden problem for permanents of a doubly stochastic matrix, Mat. Zametki
29 (1981), 931–938.Google Scholar
[36] , , and , Biased games on random boards, Random Structures and Algorithms
46 (2015), 651– 676.Google Scholar
[37] , and , Generating random graphs in biased maker-breaker games
Random Structures Algorithms
47 (2015), 615–634.Google Scholar
[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] , , , and , Robust hamiltonicity of random directed graphs, Proceedings of 26th ACMSIAM SODA, ACM Press (2015), 1752–1758.
[42] and , Introduction to Random Graphs, Cambridge University Press, 2016.
[43] and , On packing Hamilton cycles in ε-regular graphs, J. Combinatorial Theory Ser. B
94 (2005), 159–172.Google Scholar
[44] and , On two Hamilton cycle problems in random graphs, Israel J. of Mathematics
166 (2008), 221–234.Google Scholar
[45] and , On the number of Hamilton cycles in sparse random graphs, SIAM Journal on Discrete Math.
27 (2013), 27–42.Google Scholar
[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.Google Scholar
[49] , , and , Positional Games, Birkhäuser
Basel, 2014.
[50] , and , Random directed graphs are robustly Hamiltonian, Random Structures and Algorithms
49 (2016), 345–362.Google Scholar
[51] , and , Bandwidth theorem for random graphs, J. Combin. Theory Ser. B
102 (2012), 14–37.Google Scholar
[52] , and , Random graphs, Wiley, New York, 2000.
[53] , Reducibility among combinatorial problems, in: Complexity of Computer Computations, New York: Plenum (1972), 85–103.
[54] , Minimum degree of a graph and the existence of kfactors, Proc. Indian Acad. Sci. Math. Sci.
94 (1985), 123–127.Google Scholar
[55] , and , An exact minimum degree condition for Hamilton cycles in oriented graphs, J. London Math. Soc.
79 (2009), 144–166.Google Scholar
[56] , and , On asymmetry of random graphs and random regular graphs, Random Structures and Algorithms
21 (2002), 216–224.Google Scholar
[57] , and , Edge-disjoint Hamilton cycles in random graphs, Random Structures and Algorithms
46 (2015), 397– 445.Google Scholar
[58] and , Szemerédi's regularity lemma and its applications in graph theory, in Combinatorics, Paul Erdʺos is eighty, Vol. 2, Bolyai Soc. Math. Stud. 2, Budapest, 1996, 295–352.
[59] and , Limit distribution for the existence of Hamiltonian cycles in a random graph, Discrete Mathematics
43 (1983), 55–63.Google Scholar
[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.Google Scholar
[61] , Moves without forbidden transitions in a graph, Matematickỳ Časopis
18 (1968), 76–80.Google Scholar
[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.Google Scholar
[63] , and , Resilient pancyclicity of random and pseudorandom graphs, SIAM J. Discrete Math.
24 (2010), 1–16.Google Scholar
[64] , and , Robust Hamiltonicity of Dirac graphs, Transactions of the Amer. Math. Soc.
366 (2014), 3095–3130.Google Scholar
[65] , and , Long paths and cycles in random subgraphs of graphs with large minimum degree, Random Structures and Algorithms
46 (2015), 320–345.Google Scholar
[66] , and , Compatible Hamilton cycles in random graphs, Random Structures and Algorithms
49 (2016), 533– 557.Google Scholar
[67] , and , Compatible Hamilton cycles in Dirac graphs, Combinatorica, to appear.
[68] and , Optimal packings of Hamilton cycles in sparse random graphs, SIAM J. Discrete Mathematics
26 (2012), 964–982.Google Scholar
[69] and , Sparse pseudo-random graphs are Hamiltonian, J. Graph Theory
42 (2003), 17–33.Google Scholar
[70] and , Pseudo-random graphs, in: More Sets, Graphs and Numbers, Bolyai Society Mathematical Studies 15, Springer, 2006, 199–262.
[71] , , and , Random regular graphs of high degree, Random Structures and Algorithms
18 (2001), 346–363.Google Scholar
[72] , , and , On the probability of independent sets in random graphs, Random Structures and Algorithms
22 (2003), 1–14.Google Scholar
[73] , and , Optimal packings of Hamilton cycles in graphs of high minimum degree, Combinatorics, Probability, Computing
22 (2013), 394–416.Google Scholar
[74] and , Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments, Advances in Mathematics
237 (2013), 62–146.Google Scholar
[75] and , Hamilton decompositions of regular expanders: applications, J. Combinatorial Theory Series B
104 (2014), 1–27.Google Scholar
[76] , and , Hamilton decompositions of regular tournaments, Proceedings of the London Mathematical Society
101 (2010), 303–335.Google Scholar
[77] and , Dirac's theorem for random graphs, Random Structures and Algorithms
41 (2012), 293–305.Google Scholar
[78] , Properly coloured Hamiltonian cycles in edge-coloured complete graphs, Combinatorica, to appear.
[79] , Combinatorial problems and exercises, 2nd edition, AMS Chelsea Publishing, 2007.
[81] , Hamiltonian lines in graphs whose vertices have sufficiently large valencies, in: Combinatorial Theory and Its Applications, III, North-Holland, 1970, 813–819.
[82] , Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency, in: Studies in Pure Mathematics, Academic Press, London, 1971, 157–183.
[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.Google Scholar
[85] , Anti-Ramsey theorems, in: Infinite and finite sets, Vol. 11, edited by , and , Colloq. Math. Soc. János Bolyai 10, North-Holland, Amsterdam (1975), 1159–1168.
[86] , Long cycles in random subgraphs of graphs with large minimum degree
Random Structures and Algorithms
45 (2014), 764– 767.Google Scholar
[87] , and , Almost all regular graphs are Hamiltonian
Random Structures and Algorithms
5 (1994), 363–374.Google Scholar
[88] , and , On the number of Hamiltonian cycles in Dirac graphs, Discrete Math.
265 (2003), 237–250.Google Scholar
[89] , Extremal results for random discrete structures, Annals of Math.
184 (2016), 333–365.Google Scholar
[90] and , Local resilience of graphs, Random Structures and Algorithms
33 (2008), 409–433.Google Scholar
[91] , Kombinatorikai vizsgalatok az iranyitott teljes graffal, Mt. Fiz. Lapok
50 (1943), 223–256.Google Scholar
[92] , Long cycles in digraphs with constraints on the degrees, in: Surveys in Combinatorics ( ed.), London Math. Soc. Lecture Notes 38, Cambridge University Press, 1979, 211–228.
[93] , Hamilton circuits in regular tournaments, Annals of Discrete Math.
27 (1985), 159–162.Google Scholar
[94] , Models of random regular graphs, in: Surveys in Combinatorics, Cambridge University Press, 1999, 239–298.
- 7
- Cited by