#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2009

2018

- This year (1)
- Last 5 years (17)
- Last 10 years (30)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Daniela KÃ¼hn, Deryk Osthus, Andrew Treglown
- J. Comb. Theory, Ser. B
- 2010

We show that for each Î· > 0 every digraph G of sufficiently large order n is Hamiltonian if its outand indegree sequences d+1 â‰¤ Â· Â· Â· â‰¤ d + n and dâˆ’1 â‰¤ Â· Â· Â· â‰¤ d âˆ’ n satisfy (i) d + i â‰¥ i + Î·n or d âˆ’â€¦ (More)

- Daniela KÃ¼hn, Deryk Osthus, Andrew Treglown
- J. Comb. Theory, Ser. B
- 2013

We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose thatH is a sufficiently large 3-uniform hypergraph whose order n is divisibleâ€¦ (More)

We show that every sufficiently large regular tournament can almost completely be decomposed into edge-disjoint Hamilton cycles. More precisely, for each Î· > 0 every regular tournament G ofâ€¦ (More)

In this paper we prove the following results (via a unified approach) for all sufficiently large n: (i) [1-factorization conjecture] Suppose that n is even and D â‰¥ 2 n/4 âˆ’ 1. Then every D-regularâ€¦ (More)

- Daniela KÃ¼hn, Deryk Osthus, Andrew Treglown
- SIAM J. Discrete Math.
- 2009

We say that a graph G has a perfect H-packing (also called an H-factor) if there exists a set of disjoint copies of H in G which together cover all the vertices of G. Given a graph H , we determine,â€¦ (More)

- JÃ³zsef Balogh, Alexandr V. Kostochka, Andrew Treglown
- Electr. J. Comb.
- 2013

We say that a graph G has a perfect H-packing if there exists a set of vertex-disjoint copies of H which cover all the vertices in G. We consider various problems concerning perfect Hpackings: Givenâ€¦ (More)

Cameron and ErdÅ‘s [6] raised the question of how many maximal sum-free sets there are in {1, . . . , n}, giving a lower bound of 2bn/4c. In this paper we prove that there are in fact at mostâ€¦ (More)

- Jie Han, Allan Lo, Andrew Treglown, Yi Zhao
- Combinatorics, Probability & Computing
- 2017

Given hypergraphs F and H, an F -factor in H is a set of vertex-disjoint copies of F which cover all the vertices in H. Let Kâˆ’ 4 denote the 3-uniform hypergraph with 4 vertices and 3 edges. We showâ€¦ (More)

- Fiachra Knox, Andrew Treglown
- Combinatorics, Probability & Computing
- 2013

BÃ¶ttcher, Schacht and Taraz [6] gave a condition on the minimum degree of a graph G on n vertices that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidthâ€¦ (More)

- JÃ³zsef Balogh, Andrew Treglown, Zsolt Adam Wagner
- Random Struct. Algorithms
- 2016

We apply the graph container method to prove a number of counting results for the Boolean lattice P(n). In particular, we: (i) Give a partial answer to a question of Sapozhenko estimating the numberâ€¦ (More)