The Probabilistic Method
暂无分享,去创建一个
[1] B. Logan,et al. A Variational Problem for Random Young Tableaux , 1977 .
[2] Bruce A. Reed,et al. A Bound on the Strong Chromatic Index of a Graph, , 1997, J. Comb. Theory B.
[3] Noga Alon,et al. A Parallel Algorithmic Version of the Local Lemma , 1991, Random Struct. Algorithms.
[4] P. Erdös. Some remarks on the theory of graphs , 1947 .
[5] Noga Alon,et al. Disjoint Directed Cycles , 1996, J. Comb. Theory, Ser. B.
[6] Charles M. Grinstead. On Medians of Lattice Distributions and a Game with Two Dice , 1997, Combinatorics, Probability and Computing.
[7] Kazuoki Azuma. WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .
[8] Carsten Thomassen,et al. Disjoint cycles in digraphs , 1983, Comb..
[9] Noga Alon,et al. Cycles of length 0 modulo k in directed graphs , 1989, J. Comb. Theory, Ser. B.
[10] P. Erdös,et al. Graph Theory and Probability , 1959 .
[11] Noga Alon. The String Chromatic Number of a Graph , 1992, Random Struct. Algorithms.
[12] János Komlós,et al. A Dense Infinite Sidon Sequence , 1981, Eur. J. Comb..
[13] James B. Shearer,et al. A note on the independence number of triangle-free graphs , 1983, Discret. Math..
[14] Noga Alon,et al. Independence numbers of locally sparse graphs and a Ramsey type problem , 1996 .
[15] Jeff Kahn,et al. Asymptotics of the Chromatic Index for Multigraphs , 1996, J. Comb. Theory, Ser. B.
[16] M. Talagrand. Concentration of measure and isoperimetric inequalities in product spaces , 1994, math/9406212.
[17] Jeff Kahn,et al. Asymptotically Good List-Colorings , 1996, J. Comb. Theory A.
[18] Vojtech Rödl,et al. A short proof of the existence of highly chromatic hypergraphs without short cycles , 1979, J. Comb. Theory, Ser. B.
[19] D. Alling. Early Decision in the Wilcoxon Two-Sample Test , 1963 .
[20] Jeong Han Kim,et al. The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.
[21] Joel H. Spencer,et al. Asymptotic lower bounds for Ramsey functions , 1977, Discret. Math..
[22] Béla Bollobás,et al. List-colourings of graphs , 1985, Graphs Comb..
[23] János Komlós,et al. A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.
[24] Béla Bollobás,et al. Random Graphs , 1985 .
[25] Joel H. Spencer,et al. Asymptotic behavior of the chromatic index for hypergraphs , 1989, J. Comb. Theory, Ser. A.
[26] Wenceslas Fernandez de la Vega,et al. On the maximum cardinality of a consistent set of arcs in a random tournament , 1983, J. Comb. Theory, Ser. B.
[27] N. Alon,et al. Edge-disjoint cycles in regular directed graphs , 1996 .
[28] L. Lovász. On chromatic number of finite set-systems , 1968 .
[29] Jeong Han Kim. On Brooks' Theorem for Sparse Graphs , 1995, Comb. Probab. Comput..
[30] Jim Lawrence. Covering the vertex set of a graph with subgraphs of smaller degree , 1978, Discret. Math..
[31] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[32] Alan Frieze,et al. On the Length of the Longest Monotone Subsequence in a Random Permutation , 1991 .
[33] Jean-Claude Bermond,et al. Cycles in digraphs- a survey , 1981, J. Graph Theory.
[34] Roland Häggkvist,et al. New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs , 1997, Combinatorics, Probability and Computing.
[35] Peter Winkler,et al. On the Size of a Random Maximal Graph , 1995, Random Struct. Algorithms.
[36] James B. Shearer,et al. On the Independence Number of Sparse Graphs , 1995, Random Struct. Algorithms.
[37] Paul Erdös,et al. On a Combinatorial Game , 1973, J. Comb. Theory, Ser. A.
[38] József Beck,et al. An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.
[39] Noga Alon,et al. List Coloring of Random and Pseudo-Random Graphs , 1999, Comb..
[40] Vojtech Rödl,et al. On a Packing and Covering Problem , 1985, Eur. J. Comb..
[41] Alexandr V. Kostochka,et al. On an upper bound of a graph's chromatic number, depending on the graph's degree and density , 1977, J. Comb. Theory B.
[42] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[43] Michael Krivelevich,et al. Bounding Ramsey Numbers through Large Deviation Inequalities , 1995, Random Struct. Algorithms.
[44] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[45] N. Alon. The linear arboricity of graphs , 1988 .
[46] Eli Upfal,et al. Static and dynamic path selection on expander graphs: a random walk approach , 1999 .
[47] P. Turán. On a Theorem of Hardy and Ramanujan , 1934 .
[48] V. G. Vizing. SOME UNSOLVED PROBLEMS IN GRAPH THEORY , 1968 .