A Ramsey-type Result for Augmenting Graphs
On an anti-ramsey type result
... On an anti-Ramsey type result Noga Alon ∗ , Hanno Lefmann † and Vojt˘ ech R¨ odl ‡ Abstract We consider anti-Ramsey type results. For a given coloring ∆ of the k-element subsets of an ...
14
A Ramsey-Type Result for Geometric l-hypergraphs
... 2 Massachusetts Institute of Technology, Cambridge, MA [email protected] Abstract. Let n ≥ ≥ 2 and q ≥ 2. We consider the minimum N such that whenever we have N points in the plane in general position and the -subsets ...
12
Ramsey number of paths and connected matchings in Ore-type host graphs
... path-path Ramsey number) that in every 2-coloring of the edges of K 3n−1 , the complete graph on 3n − 1 vertices, there is a monochromatic P 2n , a path on 2n ...host graphs with the corresponding ...
17
A DIRAC TYPE RESULT ON HAMILTON CYCLES IN ORIENTED GRAPHS
... Since this paper was written, we have used some of the tools and methods to obtain an exact version of Theorem 1.1 (but not of Theorems 1.3 and 1.4) for large oriented graphs [12] as well as an approximate ...
19
Augmenting the algebraic connectivity of graphs
... not satisfy it and assigning different weights w (t) to them accordingly. Faster algorithm for subgraph sparsification. The second component behind proving our main result is an efficient algorithm for the ...
23
CiteSeerX — The Ramsey number of dense graphs
... the result follows. 2 The key property of random graphs that we will need to make use of is that for every vertex set V of a given size there can only be a few vertices which have greater than the expected ...
15
Calculating Ramsey numbers by partitioning colored graphs
... all graphs with minimal degree k+1 k |S| contain a kth power of Hamiltonian cycle ...for graphs with sufficiently large order by Koml´os, S´ark¨ozy, and Szemer´edi ...
25
Induced Ramsey-type theorems
... several Ramsey-type results, thereby giving much better ...the result of Graham, Rödl, and Ruci´nski [33] and has a simpler proof than the one in ...our result says that if (G 1 , . . . , G r ...
30
Induced subgraphs of Ramsey graphs with many distinct degrees
... Since there are Ω(n) choices for m the result follows. 2 Although this proposition is much weaker than Erd˝os–Faudree–Sós conjecture, we believe that our methods might prove useful to attack their problem. • The ...
8
Independent sets in hypergraphs and Ramsey properties of graphs and the integers
... AND RAMSEY PROPERTIES OF GRAPHS AND THE INTEGERS \ast ROBERT HANCOCK \dagger , KATHERINE STADEN \ddagger , AND ANDREW TREGLOWN \S ...concerning Ramsey (and Tur\' an) properties of ...
37
Ramsey-type theorems with forbidden subgraphs
... Conjecture 2 For every tournament T , there exists a positive ε = ε(T ) such that every T -free tournament with n vertices has a transitive subtournament whose size is at least n ε . Theorem 1.2 Conjecture 1 and ...
14
RAMSEY-TYPE NUMBERS FOR DEGREE SEQUENCES
... “2-color” Ramsey-type parameter for degree sequences; we are also able to define a multicolored version of r pot ...edge-disjoint graphs G 1 , ...
12
Fast Augmenting Paths by Random Sampling from Residual Graphs
... this result, as flows in this graph are not feasible for the original ...unweighted graphs, our result of ˜ O(m+nv) time is a natural stopping point, but it is not necessarily the end of progress on ...
20
On the Ramsey numbers for stars versus connected graphs of order six
... forces only green edges from w 1 to w 5 and w 6 . Again G 5 ⊆ [V ] g , and we are done. Next we consider the six non-tree graphs G ∈ G 2 where G = K 2,4 and C 6 ⊆ G. Since C 4 ⊆ G, r(S n , G) ≥ r(S n , C 4 ) for ...
24
A bound for s-distance permutation families and explicit Ramsey graphs
... Cameron gave an upper bound for the size of any s-distance family of permutations. We prove a modulo p version of Cameron’s result. In the proof we use the polynomial subspace method. As an application we describe ...
7
On three zero-sum Ramsey-type problems
... Proof of Theorem 4.1, part (i) Observe first that by Lemma 4.3 the estimate, if true, is sharp. To prove the upper bound for R(G, Z 2 ) we apply induction on n. The result is trivial for n ≤ 3. Assuming it holds ...
18
CiteSeerX — Multicolor Ramsey Numbers for Complete Bipartite Versus Complete Graphs
... Abstract Let H 1 , . . . , H k be graphs. The multicolor Ramsey number r(H 1 , . . . , H k ) is the minimum integer r such that in every edge-coloring of K r by k colors, there is a monochromatic copy of H ...
26
A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
... this result, colored complete graphs with no rainbow triangle are called Gallai colorings (or G-colorings for short) and for simplicity, the Gallai partition is often called a ...two graphs G and H, ...
7
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems
... zero-sum Ramsey theory. For instance, Caro’s results in zero-sum Ramsey numbers for graphs and Caro and Yuster’s results in zero- sum bipartite Ramsey numbers can be ...
102
Proof of principle for Ramsey-type gravity resonance spectroscopy with qBounce
... As starting parameter each neutron receives a horizontal velocity according to the distribution in Fig. 3, an initial vertical height evenly distributed between 0 and 22 µ m, and a vertical velocity evenly distributed ...
7