On edge‐ordered Ramsey numbers
暂无分享,去创建一个
[1] Choongbum Lee. Ramsey numbers of degenerate graphs , 2015, 1505.04773.
[2] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .
[3] Sheshayya A. Choudum,et al. Ordered Ramsey numbers , 2002, Discret. Math..
[4] Po-Shen Loh,et al. Increasing Hamiltonian paths in random edge orderings , 2016, Random Struct. Algorithms.
[5] Paul Erdös,et al. A Ramsey-type theorem for bipartite graphs , 2000 .
[6] J'ozsef Balogh,et al. Ordered size Ramsey number of paths , 2018, Discret. Appl. Math..
[7] Vojtech Rödl,et al. A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph , 1995, SIAM J. Comput..
[8] R. Graham,et al. Increasing paths in edge ordered graphs , 1973 .
[9] Yoshiharu Kohayakawa,et al. The Induced Size-Ramsey Number of Cycles , 1995, Combinatorics, Probability and Computing.
[10] D. Mubayi,et al. A Survey of Hypergraph Ramsey Problems , 2017, Springer Optimization and Its Applications.
[11] David Conlon,et al. Recent developments in graph Ramsey theory , 2015, Surveys in Combinatorics.
[12] P. Erdos,et al. The size Ramsey number , 1978 .
[13] David Conlon,et al. On two problems in graph Ramsey theory , 2012, Comb..
[14] V. Chvatal,et al. Some Combinatorial Theorems on Monotonicity , 1971, Canadian Mathematical Bulletin.
[15] A. Robert Calderbank,et al. Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs , 1984, Discret. Math..
[16] Anders Martinsson,et al. Most edge‐orderings of Kn have maximal altitude , 2016, Random Struct. Algorithms.
[17] Jan Kyncl,et al. Ramsey numbers of ordered graphs , 2013, Electron. Notes Discret. Math..
[18] József Beck,et al. On size Ramsey number of paths, trees, and circuits. I , 1983, J. Graph Theory.
[19] Benny Sudakov,et al. Nearly-linear monotone paths in edge-ordered graphs , 2018, Israel Journal of Mathematics.
[20] S. Burr. ON THE MAGNITUDE OF GENERALIZED RAMSEY NUMBERS FOR GRAPHS , 1973 .
[21] P. Erdös,et al. Combinatorial Theorems on Classifications of Subsets of a Given Set , 1952 .
[22] Kevin G. Milans,et al. Monotone Paths in Dense Edge-Ordered Graphs , 2015, 1509.02143.
[23] Po-Shen Loh,et al. Hamiltonian increasing paths in random edge orderings , 2014, 1403.0948.
[24] Walter Deuber. A generalization of Ramsey's theorem for regular trees , 1975 .
[25] Benny Sudakov,et al. Induced Ramsey-type theorems , 2007, Electron. Notes Discret. Math..
[26] Andrzej Dudek,et al. On some Multicolor Ramsey Properties of Random Graphs , 2016, SIAM J. Discret. Math..
[27] Jaroslav Nesetril,et al. All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) , 2016, ArXiv.
[28] R. Graham,et al. Ramsey’s theorem for $n$-parameter sets , 1971 .
[29] Benny Sudakov,et al. The size Ramsey number of a directed path , 2010, Journal of combinatorial theory. Series B (Print).
[30] M. Simonovits,et al. Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .
[31] R. Greenwood,et al. Combinatorial Relations and Chromatic Graphs , 1955, Canadian Journal of Mathematics.
[32] V. Sós,et al. Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.
[33] Joel Friedman,et al. Expanding graphs contain all small trees , 1987, Comb..
[34] Benny Sudakov,et al. The oriented size Ramsey number of directed paths , 2017, Eur. J. Comb..
[35] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[36] Saharon Shelah,et al. Primitive recursive bounds for van der Waerden numbers , 1988 .
[37] W. Marsden. I and J , 2012 .