[图书][B] The probabilistic method
N Alon, JH Spencer - 2016 - books.google.com
Praise for the Third Edition “Researchers of any kind of extremal combinatorics or theoretical
computer science will welcome the new edition of this book.”-MAA Reviews Maintaining a …
computer science will welcome the new edition of this book.”-MAA Reviews Maintaining a …
[图书][B] Lectures on discrete geometry
J Matousek - 2013 - books.google.com
This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …
area, it explains several key results and methods, in an accessible and concrete manner. It …
The history of degenerate (bipartite) extremal graph problems
Z Füredi, M Simonovits - Erdős centennial, 2013 - Springer
The History of Degenerate (Bipartite) Extremal Graph Problems Page 1 BOLYAI SOCIETY
Erdos Centennial MATHEMATICAL STUDIES, 25 pp. 169–264. The History of Degenerate (Bipartite) …
Erdos Centennial MATHEMATICAL STUDIES, 25 pp. 169–264. The History of Degenerate (Bipartite) …
[HTML][HTML] Many T copies in H-free graphs
N Alon, C Shikhelman - Journal of Combinatorial Theory, Series B, 2016 - Elsevier
For two graphs T and H with no isolated vertices and for an integer n, let ex (n, T, H) denote
the maximum possible number of copies of T in an H-free graph on n vertices. The study of …
the maximum possible number of copies of T in an H-free graph on n vertices. The study of …
Pseudo-random graphs
M Krivelevich, B Sudakov - More sets, graphs and numbers: A Salute to …, 2006 - Springer
Random graphs have proven to be one of the most important and fruitful concepts in modern
Combinatorics and Theoretical Computer Science. Besides being a fascinating study …
Combinatorics and Theoretical Computer Science. Besides being a fascinating study …
[图书][B] Geometric discrepancy: An illustrated guide
J Matousek - 2009 - books.google.com
Discrepancy theory is also called the theory of irregularities of distribution. Here are some
typical questions: What is the" most uniform" way of dis tributing n points in the unit square …
typical questions: What is the" most uniform" way of dis tributing n points in the unit square …
The early evolution of the H-free process
T Bohman, P Keevash - Inventiones mathematicae, 2010 - Springer
The H-free process, for some fixed graph H, is the random graph process defined by starting
with an empty graph on n vertices and then adding edges one at a time, chosen uniformly at …
with an empty graph on n vertices and then adding edges one at a time, chosen uniformly at …
A survey on spectral conditions for some extremal graph problems
Y Li, W Liu, L Feng - arXiv preprint arXiv:2111.03309, 2021 - arxiv.org
This survey is two-fold. We first report new progress on the spectral extremal results on the
Tur\'{a} n type problems in graph theory. More precisely, we shall summarize the spectral …
Tur\'{a} n type problems in graph theory. More precisely, we shall summarize the spectral …
Some new results in extremal graph theory
V Nikiforov - arXiv preprint arXiv:1107.1121, 2011 - arxiv.org
In recent years several classical results in extremal graph theory have been improved in a
uniform way and their proofs have been simplified and streamlined. These results include a …
uniform way and their proofs have been simplified and streamlined. These results include a …