889 research outputs found
Resolution of the Oberwolfach problem
The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of
into edge-disjoint copies of a given -factor. We show that this
can be achieved for all large . We actually prove a significantly more
general result, which allows for decompositions into more general types of
factors. In particular, this also resolves the Hamilton-Waterloo problem for
large .Comment: 28 page
Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
The idea of computing Matveev complexity by using Heegaard decompositions has
been recently developed by two different approaches: the first one for closed
3-manifolds via crystallization theory, yielding the notion of Gem-Matveev
complexity; the other one for compact orientable 3-manifolds via generalized
Heegaard diagrams, yielding the notion of modified Heegaard complexity. In this
paper we extend to the non-orientable case the definition of modified Heegaard
complexity and prove that for closed 3-manifolds Gem-Matveev complexity and
modified Heegaard complexity coincide. Hence, they turn out to be useful
different tools to compute the same upper bound for Matveev complexity.Comment: 12 pages; accepted for publication in Topology and Its Applications,
volume containing Proceedings of Prague Toposym 201
On the decomposition threshold of a given graph
We study the -decomposition threshold for a given graph .
Here an -decomposition of a graph is a collection of edge-disjoint
copies of in which together cover every edge of . (Such an
-decomposition can only exist if is -divisible, i.e. if and each vertex degree of can be expressed as a linear combination of
the vertex degrees of .)
The -decomposition threshold is the smallest value ensuring
that an -divisible graph on vertices with
has an -decomposition. Our main results imply
the following for a given graph , where is the fractional
version of and :
(i) ;
(ii) if , then
;
(iii) we determine if is bipartite.
In particular, (i) implies that . Our proof
involves further developments of the recent `iterative' absorbing approach.Comment: Final version, to appear in the Journal of Combinatorial Theory,
Series
Completing Partial Packings of Bipartite Graphs
Given a bipartite graph and an integer , let be the smallest
integer such that, any set of edge disjoint copies of on vertices, can
be extended to an -design on at most vertices. We establish tight
bounds for the growth of as . In particular, we
prove the conjecture of F\"uredi and Lehel \cite{FuLe} that .
This settles a long-standing open problem
A note about complexity of lens spaces
Within crystallization theory, (Matveev's) complexity of a 3-manifold can be
estimated by means of the combinatorial notion of GM-complexity. In this paper,
we prove that the GM-complexity of any lens space L(p,q), with p greater than
2, is bounded by S(p,q)-3, where S(p,q) denotes the sum of all partial
quotients in the expansion of q/p as a regular continued fraction. The above
upper bound had been already established with regard to complexity; its
sharpness was conjectured by Matveev himself and has been recently proved for
some infinite families of lens spaces by Jaco, Rubinstein and Tillmann. As a
consequence, infinite classes of 3-manifolds turn out to exist, where
complexity and GM-complexity coincide.
Moreover, we present and briefly analyze results arising from crystallization
catalogues up to order 32, which prompt us to conjecture, for any lens space
L(p,q) with p greater than 2, the following relation: k(L(p,q)) = 5 + 2
c(L(p,q)), where c(M) denotes the complexity of a 3-manifold M and k(M)+1 is
half the minimum order of a crystallization of M.Comment: 14 pages, 2 figures; v2: we improved the paper (changes in
Proposition 10; Corollary 9 and Proposition 11 added) taking into account
Theorem 2.6 of arxiv:1310.1991v1 which makes use of our Prop. 6(b)
(arxiv:1309.5728v1). Minor changes have been done, too, in particular to make
references more essentia
Computing Matveev's complexity via crystallization theory: the boundary case
The notion of Gem-Matveev complexity has been introduced within
crystallization theory, as a combinatorial method to estimate Matveev's
complexity of closed 3-manifolds; it yielded upper bounds for interesting
classes of such manifolds. In this paper we extend the definition to the case
of non-empty boundary and prove that for each compact irreducible and
boundary-irreducible 3-manifold it coincides with the modified Heegaard
complexity introduced by Cattabriga, Mulazzani and Vesnin. Moreover, via
Gem-Matveev complexity, we obtain an estimation of Matveev's complexity for all
Seifert 3-manifolds with base and two exceptional fibers and,
therefore, for all torus knot complements.Comment: 27 pages, 14 figure
- …