45 research outputs found
Colored complete hypergraphs containing no rainbow Berge triangles
The study of graph Ramsey numbers within restricted colorings, in particular forbidding a rainbow triangle, has recently been blossoming under the name Gallai-Ramsey numbers. In this work, we extend the main structural tool from rainbow triangle free colorings of complete graphs to rainbow Berge triangle free colorings of hypergraphs. In doing so, some other concepts and results are also translated from graphs to hypergraphs
Monochromatic -connected Subgraphs in 2-edge-colored Complete Graphs
Bollob\'{a}s and Gy\'{a}rf\'{a}s conjectured that for any with , every 2-edge-coloring of the complete graph on
vertices leads to a -connected monochromatic subgraph with at least
vertices. We find a counterexample with , thus disproving the conjecture, and we show the
conjecture is true for
Rainbow Generalizations of Ramsey Theory - A Dynamic Survey
In this work, we collect Ramsey-type results concerning rainbow edge colorings of graphs
Rainbow Generalizations of Ramsey Theory - A Dynamic Survey
In this work, we collect Ramsey-type results concerning rainbow edge colorings of graphs
Rainbow Generalizations of Ramsey Theory - A Dynamic Survey
In this work, we collect Ramsey-type results concerning rainbow edge colorings of graphs
Recent developments in graph Ramsey theory
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring of the edges of K_N contains a monochromatic copy of H. The existence of these numbers has been known since 1930 but their quantitative behaviour is still not well understood. Even so, there has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by the many advances across extremal combinatorics. In this survey, we will describe some of this progress
Recommended from our members
Combinatorics
Combinatorics is a fundamental mathematical discipline that focuses on the study of discrete objects and their
properties. The present workshop featured research in such diverse areas as Extremal, Probabilistic
and Algebraic Combinatorics, Graph Theory, Discrete Geometry, Combinatorial Optimization,
Theory of Computation and Statistical Mechanics. It provided current accounts of exciting developments and challenges in these fields and a stimulating venue for a variety of fruitful interactions.
This is a report on the meeting, containing extended abstracts of the presentations and a summary of the problem session
Recommended from our members
Extremal and Structural Problems of Graphs
In this dissertation, we are interested in studying several parameters of graphs and understanding their extreme values.
We begin in Chapter~ with a question on edge colouring. When can a partial proper edge colouring of a graph of maximum degree be extended to a proper colouring of the entire graph using an `optimal' set of colours? Albertson and Moore conjectured this is always possible provided no two precoloured edges are within distance . The main result of Chapter~ comes close to proving this conjecture. Moreover, in Chapter~, we completely answer the previous question for the class of planar graphs.
Next, in Chapter~, we investigate some Ramsey theoretical problems. We determine exactly what minimum degree a graph must have to guarantee that, for any two-colouring of , we can partition into two parts where each part induces a connected monochromatic subgraph. This completely resolves a conjecture of Bal and Debiasio. We also prove a `covering' version of this result. Finally, we study another variant of these problems which deals with coverings of a graph by monochromatic components of distinct colours.
The following saturation problem proposed by Barrus, Ferrara, Vandenbussche, and Wenger is considered in Chapter~. Given a graph and a set of colours (for some integer ), we define to be the minimum number of -coloured edges in a graph on vertices which does not contain a rainbow copy of but the addition of any non-edge in any colour from creates such a copy. We prove several results concerning these extremal numbers. In particular, we determine the correct order of , as a function of , for every connected graph of minimum degree greater than and for every integer .
In Chapter~, we consider the following question: under what conditions does a Hamiltonian graph on vertices possess a second cycle of length at least ?
We prove that the `weak' assumption of a minimum degree greater or equal to guarantees the existence of such a long cycle.
We solve two problems related to majority colouring in Chapter~. This topic was recently studied by Kreutzer, Oum, Seymour, van der Zypen and Wood. They raised the problem of determining, for a natural number , the smallest positive integer such that every digraph can be coloured with colours, where each vertex has the same colour as at most a proportion of of its out-neighbours. Our main theorem states that .
We study the following problem, raised by Caro and Yuster, in Chapter~. Does every graph contain a `large' induced subgraph which has vertices of degree exactly ? We answer in the affirmative an approximate version of this question. Indeed, we prove that, for every , there exists such that any vertex graph with maximum degree contains an induced subgraph with at least vertices such that contains at least vertices of the same degree . This result is sharp up to the order of .
%Subsequently, we investigate a concept called . A graph is said to be path-pairable if for any pairing of its vertices there exist a collection of edge-disjoint paths routing the the vertices of each pair. A question we are concerned here asks whether every planar path pairable graph on vertices must possess a vertex of degree linear in . Indeed, we answer this question in the affirmative. We also sketch a proof resolving an analogous question for graphs embeddable on surfaces of bounded genus.
Finally, in Chapter~, we move on to examine -linked tournaments. A tournament is said to be -linked if for any two disjoint sets of vertices and there are directed vertex disjoint paths such that joins to for . We prove that any strongly-connected tournament with sufficiently large minimum out-degree is -linked. This result comes close to proving a conjecture of Pokrovskiy