论文信息 - Algebraic and Probabilistic Methods in Discrete Mathematics

Algebraic and Probabilistic Methods in Discrete Mathematics

[5] Svante Janson,et al. Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[6] J. A. Dias da Silva,et al. Cyclic Spaces for Grassmann Derivatives and Additive Theory , 1994 .

[7] J. Petersen. Die Theorie der regulären graphs , 1891 .

[8] György Elekes,et al. On the number of sums and products , 1997 .

[9] Béla Bollobás,et al. List-colourings of graphs , 1985, Graphs Comb..

[10] G. Ringel,et al. Solution of the heawood map-coloring problem. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[11] A. Ziv,et al. Theorem in the Additive Number Theory , 2022 .

[12] F. Thomas Leighton,et al. Complexity Issues in VLSI , 1983 .

[13] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[14] J. Spencer. Ten lectures on the probabilistic method , 1987 .

[15] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[16] Noga Alon,et al. The Shannon Capacity of a Union , 1998, Comb..

[17] Karol Borsuk. Drei Sätze über die n-dimensionale euklidische Sphäre , 1933 .

[18] Lajos Rónyai. On a Conjecture of Kemnitz , 2000, Comb..

[19] Burton Randol,et al. A lattice-point problem , 1966 .

[20] Wolfgang M. Schmidt,et al. Equations over Finite Fields: An Elementary Approach , 1976 .

[21] Noga Alon,et al. Zero-sum sets of prescribed size , 1993 .

[22] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[23] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..

[24] P. Frankl,et al. Linear Algebra Methods in Combinatorics I , 1988 .

[25] A. M. Raigorodski. On Borsuk's problem , 1997 .

[26] Willem H. Haemers,et al. On Some Problems of Lovász Concerning the Shannon Capacity of a Graph , 1979, IEEE Trans. Inf. Theory.

[27] Melvyn B. Nathanson,et al. Additive Number Theory , 1996 .

[28] E. Szemerédi,et al. Crossing-Free Subgraphs , 1982 .

[29] Peter Frankl,et al. Intersection theorems with geometric consequences , 1981, Comb..

[30] Noga Alon,et al. The Polynomial Method and Restricted Sums of Congruence Classes , 1996 .

[31] Aart Blokhuis. Polynomials in finite geometries and combinatorics , 1993 .

[32] Noga Alon. Combinatorial Nullstellensatz , 1999, Combinatorics, Probability and Computing.

[33] J. Kahn,et al. A counterexample to Borsuk's conjecture , 1993, math/9307229.

[34] W. Schmidt. Equations over Finite Fields: An Elementary Approach , 1976 .

[35] L. A S Z L,et al. Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997 .

[36] Mark N. Ellingham,et al. List edge colourings of some 1-factorable multigraphs , 1996, Comb..

[37] V. Sós,et al. Combinatorics, Paul Erdős is eighty , 1993 .

[38] N. Alon. Tools from higher algebra , 1996 .

[39] L. A. Oa,et al. Crossing Numbers and Hard Erd} os Problems in Discrete Geometry , 1997 .

[40] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.

[41] Endre Szemerédi,et al. Extremal problems in discrete geometry , 1983, Comb..

[42] R. Graham,et al. Handbook of Combinatorics , 1995 .

[43] J. Shaw. Combinatory Analysis , 1917, Nature.

[44] N. Alon,et al. On acyclic colorings of graphs on surfaces , 1996 .

[45] Melvyn B. Nathanson,et al. Additive Number Theory: Inverse Problems and the Geometry of Sumsets , 1996 .

[46] Roger Knott. Theory and Practice of Combinatorics , 1983 .

[47] P. Erdos,et al. Old and new problems and results in combinatorial number theory , 1980 .

[48] Chris Godsil,et al. Tools from linear algebra , 1996 .

[49] P. Erdös. Some remarks on the theory of graphs , 1947 .

[50] N. Alon. Restricted colorings of graphs , 1993 .

[51] B. Bollobás. Surveys in Combinatorics , 1979 .

[52] Ramsey Theory,et al. Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.