14,838 research outputs found
Density theorems for bipartite graphs and related Ramsey-type results
In this paper, we present several density-type theorems which show how to
find a copy of a sparse bipartite graph in a graph of positive density. Our
results imply several new bounds for classical problems in graph Ramsey theory
and improve and generalize earlier results of various researchers. The proofs
combine probabilistic arguments with some combinatorial ideas. In addition,
these techniques can be used to study properties of graphs with a forbidden
induced subgraph, edge intersection patterns in topological graphs, and to
obtain several other Ramsey-type statements
Difference Ramsey Numbers and Issai Numbers
We present a recursive algorithm for finding good lower bounds for the
classical Ramsey numbers. Using notions from this algorithm we then give some
results for generalized Schur numbers, which we call Issai numbers.Comment: 10 page
On the Ramsey-Tur\'an number with small -independence number
Let be an integer, a function, and a graph. Define the
Ramsey-Tur\'an number as the maximum number of edges in an
-free graph of order with , where is
the maximum number of vertices in a -free induced subgraph of . The
Ramsey-Tur\'an number attracted a considerable amount of attention and has been
mainly studied for not too much smaller than . In this paper we consider
for fixed . We show that for an arbitrarily
small and , for all sufficiently large . This is
nearly optimal, since a trivial upper bound yields . Furthermore, the range of is as large as possible.
We also consider more general cases and find bounds on
for fixed . Finally, we discuss a phase
transition of extending some recent result of Balogh, Hu
and Simonovits.Comment: 25 p
The critical window for the classical Ramsey-Tur\'an problem
The first application of Szemer\'edi's powerful regularity method was the
following celebrated Ramsey-Tur\'an result proved by Szemer\'edi in 1972: any
K_4-free graph on N vertices with independence number o(N) has at most (1/8 +
o(1)) N^2 edges. Four years later, Bollob\'as and Erd\H{o}s gave a surprising
geometric construction, utilizing the isoperimetric inequality for the high
dimensional sphere, of a K_4-free graph on N vertices with independence number
o(N) and (1/8 - o(1)) N^2 edges. Starting with Bollob\'as and Erd\H{o}s in
1976, several problems have been asked on estimating the minimum possible
independence number in the critical window, when the number of edges is about
N^2 / 8. These problems have received considerable attention and remained one
of the main open problems in this area. In this paper, we give nearly
best-possible bounds, solving the various open problems concerning this
critical window.Comment: 34 page
Ramsey numbers and adiabatic quantum computing
The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In
fact, for the two-color Ramsey numbers with , only nine are
currently known. We present a quantum algorithm for the computation of the
Ramsey numbers . We show how the computation of can be mapped
to a combinatorial optimization problem whose solution can be found using
adiabatic quantum evolution. We numerically simulate this adiabatic quantum
algorithm and show that it correctly determines the Ramsey numbers R(3,3) and
R(2,s) for . We then discuss the algorithm's experimental
implementation, and close by showing that Ramsey number computation belongs to
the quantum complexity class QMA.Comment: 4 pages, 1 table, no figures, published versio
- …