Abstract. A fundamental theorem of Wilson states that, for every graph F , every sufficiently large F -divisible clique has an F -decomposition. Here a graph G is F -divisible if e(F ) divides e(G) and the greatest common divisor of the degrees of F divides the greatest common divisor of the degrees of G, and G has an F -decomposition if the edges of G can be covered by edge-disjoint copies of F . We extend this result to graphs G which are allowed to be far from complete. In particular, together with a result of Dross, our results imply that every sufficiently large K3-divisible graph of minimum degree at least 9n/10 + o(n) has a K3-decomposition. This significantly improves previous results towards the long-standing conjecture of Nash-Williams that every sufficiently large K3-divisible graph with minimum degree at least 3n/4 has a K3-decomposition. We also obtain the asymptotically correct minimum degree thresholds of 2n/3 + o(n) for the existence of a C4-decomposition, and of n/2 + o(n) for the existence of a C 2ℓ -decomposition, where ℓ ≥ 3. Our main contribution is a general 'iterative absorption' method which turns an approximate or fractional decomposition into an exact one. In particular, our results imply that in order to prove an asymptotic version of Nash-Williams' conjecture, it suffices to show that every K3-divisible graph with minimum degree at least 3n/4 + o(n) has an approximate K3-decomposition,
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was obtained. Here, we illustrate the method by investigating triangle decompositions: we give a simple proof that a triangle-divisible graph of large minimum degree has a triangle decomposition and prove a similar result for quasirandom host graphs.
Our main result is that every graph G on n ≥ 10 4 r 3 vertices with minimum degree δ(G) ≥ (1−1/10 4 r 3/2 )n has a fractional Kr-decomposition. Combining this result with recent work of Barber, Kühn, Lo and Osthus leads to the best known minimum degree thresholds for exact (non-fractional) F -decompositions for a wide class of graphs F (including large cliques). For general k-uniform hypergraphs, we give a short argument which shows that there exists a constant c k > 0 such that every k-uniform hypergraph G on n vertices with minimum codegree at least (1 − c k /r 2k−1 )n has a fractional Kis the complete k-uniform hypergraph on r vertices. (Related fractional decomposition results for triangles have been obtained by Dross and for hypergraph cliques by Dukes as well as Yuster.) All the above new results involve purely combinatorial arguments. In particular, this yields a combinatorial proof of Wilson's theorem that every large F -divisible complete graph has an F -decomposition.
Abstract. Our main result essentially reduces the problem of finding an edge-decomposition of a balanced r-partite graph of large minimum degree into r-cliques to the problem of finding a fractional r-clique decomposition or an approximate one. Together with very recent results of Bowditch and Dukes as well as Montgomery on fractional decompositions into triangles and cliques respectively, this gives the best known bounds on the minimum degree which ensures an edge-decomposition of an r-partite graph into r-cliques (subject to trivially necessary divisibility conditions). The case of triangles translates into the setting of partially completed Latin squares and more generally the case of r-cliques translates into the setting of partially completed mutually orthogonal Latin squares.
A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solution. The Finite Sums theorem provided the first example of an infinite partition regular system of equations. Since then, other such systems of equations have been found, but each can be viewed as a modification of the Finite Sums theorem. We present here a new infinite partition regular system of equations that appears to arise in a genuinely different way. This is the first example of a partition regular system in which a variable occurs with unbounded coefficients. A modification of the system provides an example of a system that is partition regular over Q but not N, settling another open problem.Comment: 11 page
Abstract. A fundamental theorem of Wilson states that, for every graph F , every sufficiently large F -divisible clique has an F -decomposition. Here a graph G is F -divisible if e(F ) divides e(G) and the greatest common divisor of the degrees of F divides the greatest common divisor of the degrees of G, and G has an F -decomposition if the edges of G can be covered by edge-disjoint copies of F . We extend this result to graphs G which are allowed to be far from complete. In particular, together with a result of Dross, our results imply that every sufficiently large K3-divisible graph of minimum degree at least 9n/10 + o(n) has a K3-decomposition. This significantly improves previous results towards the long-standing conjecture of Nash-Williams that every sufficiently large K3-divisible graph with minimum degree at least 3n/4 has a K3-decomposition. We also obtain the asymptotically correct minimum degree thresholds of 2n/3 + o(n) for the existence of a C4-decomposition, and of n/2 + o(n) for the existence of a C 2 -decomposition, where ≥ 3. Our main contribution is a general 'iterative absorption' method which turns an approximate or fractional decomposition into an exact one. In particular, our results imply that in order to prove an asymptotic version of Nash-Williams' conjecture, it suffices to show that every K3-divisible graph with minimum degree at least 3n/4 + o(n) has an approximate K3-decomposition.
For a left-compressed intersecting family A ⊆ [n] (r) and a set X ⊆ [n], let A(X) = {A ∈ A : A ∩ X = ∅}. Borg asked: for which X is |A(X)| maximised by taking A to be all r-sets containing the element 1? We determine exactly which X have this property, for n sufficiently large depending on r.Question 2. For which X do we have |A(X)| ≤ |S(X)| for all left-compressed intersecting families A?Borg asked this question in [2], giving a complete answer for the case |X| ≥ r and a partial answer for the case |X| < r. Call X good (for n and r) if for every left-compressed intersecting family A ⊆ [n] (r) we have |A(X)| ≤ |S(X)|.
A finite or infinite matrix A with rational entries is called partition regular if whenever the natural numbers are finitely coloured there is a monochromatic vector x with Ax = 0. Many of the classical theorems of Ramsey Theory may naturally be interpreted as assertions that particular matrices are partition regular. In the finite case, Rado proved that a matrix is partition regular if and only it satisfies a computable condition known as the columns property. The first requirement of the columns property is that some set of columns sums to zero.In the infinite case, much less is known. There are many examples of matrices with the columns property that are not partition regular, but until now all known examples of partition regular matrices did have the columns property. Our main aim in this paper is to show that, perhaps surprisingly, there are infinite partition regular matrices without the columns propertyin fact, having no set of columns summing to zero.We also make a conjecture that if a partition regular matrix (say with integer coefficients) has bounded row sums then it must have the columns property, and prove a first step towards this.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.