Browsing by Author "369c9b39-07a5-4b7e-b89e-6ef812ed0bf0"
Now showing items 1-16 of 16
-
(Wiley-Liss Inc., 2019)© 2018 Wiley Periodicals Inc. We show that for every η > 0 there exists an integer n 0 such that every 2-coloring of the 3-uniform complete hypergraph on n ≥ n 0 vertices contains two disjoint monochromatic tight cycles ...
-
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Elsevier B.V., 2017)We show that any 2-colouring of the 3-uniform complete hypergraph Kn (3) on n vertices contains two disjoint monochromatic tight cycles of distinct colours covering all but o(n) vertices of Kn (3). The same result holds ...
-
(Society for Industrial and Applied Mathematics Publications, 2017)We show that for any coloring of the edges of the complete bipartite graph Kn,n with three colors there are five disjoint monochromatic cycles which together cover all but o(n) of the vertices. In the same situation, 18 ...
-
(Springer, 2017)It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on t vertices, for fixed t. We propose an algorithm that, given a 3-colorable ...
-
(Elsevier, 2017)We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are 2-clique colorable. In ...
-
(Academic Press- Elsevier, 2017)We show that for any 2-local colouring of the edges of the balanced complete bipartite graph Kn,n, its vertices can be covered with at most 3 disjoint monochromatic paths. And, we can cover almost all vertices of any ...
-
(Siam, 2020)We propose the following conjecture: For every fixed alpha is an element of [0, 1/3), each graph of minimum degree at least (1 + alpha)k/2 and maximum degree at least 2(1 - alpha)k contains each tree with k edges as a ...
-
(Elsevier B.V., 2018)We consider a generalisation of the classical Ramsey theory setting to a setting where each of the edges of the underlying host graph is coloured with a set of colours (instead of just one colour). We give bounds for ...
-
(Elsevier, 2018-06)We show that for all l, k, n with l <= k/2 and (k-l) dividing n the following hypergraph-variant of Lehel's conjecture is true. Every 2-edge-colouring of the k-uniform complete hypergraph kappa((k))(n) on n vertices has ...
-
(Wiley-Liss Inc., 2019)© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distinct colours, given that ...
-
(Wiley, 2020)Advancing the sparse regularity method, we prove one-sided and two-sided regularity inheritance lemmas for subgraphs of bijumbled graphs, improving on results of Conlon, Fox, and Zhao. These inheritance lemmas also imply ...
-
(Society for Industrial and Applied Mathematics Publications, 2017)In a series of four papers we prove the following relaxation of the Loebl–Koml ́os–S ́os Con-jecture: For everyα >0 there exists a numberk0such that for everyk > k0everyn-vertexgraphGwith at least (12+α)nvertices of degree ...
-
(Society for Industrial and Applied Mathematics, 2017)This is the second of a series of four papers in which we prove the following relaxation of the Loebl-Komlós-Sós conjecture: For every α > 0 there exists a number k0 such that for every k > k0, every n-vertex graph ...
-
(Society for Industrial and Applied Mathematics, 2017)This is the third of a series of four papers in which we prove the following relaxation ofthe Loebl–Komlós–S ́os Conjecture: For everyα >0 there exists a numberk0such that foreveryk > k0everyn-vertex ...
-
(Society for Industrial and Applied Mathematics Publications, 2017)This is the last of a series of four papers in which we prove the following relaxation of the Loebl-Komlós-Sós conjecture: For every α > 0 there exists a number k0 such that for every k > k0, every n-vertex graph G ...
-
(European Mathematical Society, 2018)We conjecture that a finitely generated group has a decidable domino problem if and only if it is virtually free. We show this is true for all virtually nilpotent finitely generated groups (or, equivalently, groups of ...
