ATAndrew Treglown
Andrew Treglown
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Andrew Treglown has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- József Balogh
Department of Mathematical Sciences University of Illinois at Urbana-Champaign 61801 Urbana Illinois USA
10 shared publications - Simón Piga
University of Birmingham, United Kingdom
8 shared publications - Adam Zsolt Wagner
Department of Mathematical Sciences University of Illinois at Urbana‐Champaign Urbana Illinois
6 shared publications - Andrea Freschi
School of Mathematics, University of Birmingham, U.K.
6 shared publications - Hong Liu
Extremal Combinatorics and Probability Group (ECOPRO), Institute for Basic Science (IBS), Daejeon, South Korea
4 shared publications - Igor Araujo
University of Illinois at Urbana-Champaign
4 shared publications
Latest Publications
- Open Access
Cycle tilings and $H$-factors in directed graphs
We prove several results concerning cycle tilings and $H$-factors in digraphs. We provide a minimum semi-degree condition for forcing a digraph to contain a given spanning collection of vertex-disjoint orientations of cycles. Our result is asymptotically best possible for odd cycles and can be viewed as a digraph analogue of the El-Zahar conjecture. In addition, we asymptotically determine the minimum degree threshold for forcing an $H$-factor in a digraph for a range of digraphs $H$, including the cases when $H$ is a tree or anti-directed cycle. Furthermore, an asymptotically exact Ore-type result for forcing a transitive tournament factor in a digraph is proven. Several related open problems are also highlighted.Open AccessCycle tilings and $H$-factors in directed graphs
We prove several results concerning cycle tilings and $H$-factors in digraphs. We provide a minimum semi-degree condition for forcing a digraph to contain a given spanning collection of vertex-disjoint orientations of cycles. Our result is asymptotically best possible for odd cycles and can be viewed as a digraph analogue of the El-Zahar conjecture. In addition, we asymptotically determine the minimum degree threshold for forcing an $H$-factor in a digraph for a range of digraphs $H$, including the cases when $H$ is a tree or anti-directed cycle. Furthermore, an asymptotically exact Ore-type result for forcing a transitive tournament factor in a digraph is proven. Several related open problems are also highlighted. - Open Access
Notes on sum-free sets in abelian groups
In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our proof makes use of the container method.Open AccessNotes on sum-free sets in abelian groups
In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our proof makes use of the container method. - Open Access
Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
In 1960, Ghouila-Houri proved that every strongly connected directed graph $G$ on $n$ vertices with minimum degree at least $n$ contains a directed Hamilton cycle. We asymptotically generalize this result by proving the following: every directed graph $G$ on $n$ vertices and with minimum degree at least $(1+o(1))n$ contains every orientation of a Hamilton cycle, except for the directed Hamilton cycle in the case when $G$ is not strongly connected. In fact, this minimum degree condition forces every orientation of a cycle in $G$ of every possible length, other than perhaps the directed cycles.Open AccessArbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
In 1960, Ghouila-Houri proved that every strongly connected directed graph $G$ on $n$ vertices with minimum degree at least $n$ contains a directed Hamilton cycle. We asymptotically generalize this result by proving the following: every directed graph $G$ on $n$ vertices and with minimum degree at least $(1+o(1))n$ contains every orientation of a Hamilton cycle, except for the directed Hamilton cycle in the case when $G$ is not strongly connected. In fact, this minimum degree condition forces every orientation of a cycle in $G$ of every possible length, other than perhaps the directed cycles. - Open Access
A note on colour-bias perfect matchings in hypergraphs
A result of Balogh, Csaba, Jing and Pluhár yields the minimum degree threshold that ensures a $2$-coloured graph contains a perfect matching of significant colour-bias (i.e., a perfect matching that contains significantly more than half of its edges in one colour). In this note we prove an analogous result for perfect matchings in $k$-uniform hypergraphs. More precisely, for each $2\leq \ell <k$ and $r\geq 2$ we determine the minimum $\ell$-degree threshold for forcing a perfect matching of significant colour-bias in an $r$-coloured $k$-uniform hypergraph.Open AccessA note on colour-bias perfect matchings in hypergraphs
A result of Balogh, Csaba, Jing and Pluhár yields the minimum degree threshold that ensures a $2$-coloured graph contains a perfect matching of significant colour-bias (i.e., a perfect matching that contains significantly more than half of its edges in one colour). In this note we prove an analogous result for perfect matchings in $k$-uniform hypergraphs. More precisely, for each $2\leq \ell <k$ and $r\geq 2$ we determine the minimum $\ell$-degree threshold for forcing a perfect matching of significant colour-bias in an $r$-coloured $k$-uniform hypergraph. - Open Access
- 12 January 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (1) , P1.19
On Some Extremal and Probabilistic Questions for Tree Posets
Given two posets $P,Q$ we say that $Q$ is $P$-free if $Q$ does not contain a copy of $P$. The size of the largest $P$-free family in $2^{[n]}$, denoted by $La(n,P)$, has been extensively studied since the 1980s. We consider several related problems. For posets $P$ whose Hasse diagrams are trees and have radius at most $2$, we prove that there are $2^{(1+o(1))La(n,P)}$ $P$-free families in $2^{[n]}$, thereby confirming a conjecture of Gerbner, Nagy, Patkós and Vizer [Electronic Journal of Combinatorics, 2021] in this case. For such $P$ we also resolve the random version of the $P$-free problem, thus generalising the random version of Sperner's theorem due to Balogh, Mycroft and Treglown [Journal of Combinatorial Theory Series A, 2014], andCollares Neto and Morris [Random Structures and Algorithms, 2016]. Additionally, we make a general conjecture that, roughly speaking, asserts that subfamilies of $2^{[n]}$ of size sufficiently above $La(n,P)$ robustly contain $P$, for any poset $P$ whose Hasse diagram is a tree.- 12 January 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (1) , P1.19
Open AccessOn Some Extremal and Probabilistic Questions for Tree Posets
Given two posets $P,Q$ we say that $Q$ is $P$-free if $Q$ does not contain a copy of $P$. The size of the largest $P$-free family in $2^{[n]}$, denoted by $La(n,P)$, has been extensively studied since the 1980s. We consider several related problems. For posets $P$ whose Hasse diagrams are trees and have radius at most $2$, we prove that there are $2^{(1+o(1))La(n,P)}$ $P$-free families in $2^{[n]}$, thereby confirming a conjecture of Gerbner, Nagy, Patkós and Vizer [Electronic Journal of Combinatorics, 2021] in this case. For such $P$ we also resolve the random version of the $P$-free problem, thus generalising the random version of Sperner's theorem due to Balogh, Mycroft and Treglown [Journal of Combinatorial Theory Series A, 2014], andCollares Neto and Morris [Random Structures and Algorithms, 2016]. Additionally, we make a general conjecture that, roughly speaking, asserts that subfamilies of $2^{[n]}$ of size sufficiently above $La(n,P)$ robustly contain $P$, for any poset $P$ whose Hasse diagram is a tree. - Open Access
- 22 December 2023
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 3 (3)
The induced saturation problem for posets
For a fixed poset \(P\), a family \(\mathcal F\) of subsets of \([n]\) is induced \(P\)-saturated if \(\mathcal F\) does not contain an induced copy of \(P\), but for every subset \(S\) of \([n]\) such that \( S\not \in \mathcal F\), \(P\) is an induced subposet of \(\mathcal F \cup \{S\}\). The size of the smallest such family \(\mathcal F\) is denoted by \(\text{sat}^* (n,P)\). Keszegh, Lemons, Martin, Pálvölgyi and Patkós [Journal of Combinatorial Theory Series A, 2021] proved that there is a dichotomy of behaviour for this parameter: given any poset \(P\), either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P)\geq \log _2 n\). In this paper we improve this general result showing that either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P) \geq \min\{ 2 \sqrt{n}, n/2+1\}\). Our proof makes use of a Turán-type result for digraphs.Curiously, it remains open as to whether our result is essentially best possible or not. On the one hand, a conjecture of Ivan states that for the so-called diamond poset \(\Diamond\) we have \(\text{sat}^* (n,\Diamond)=\Theta (\sqrt{n})\); so if true this conjecture implies our result is tight up to a multiplicative constant. On the other hand, a conjecture of Keszegh, Lemons, Martin, Pálvölgyi and Patkós states that given any poset \(P\), either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P)\geq n+1\). We prove that this latter conjecture is true for a certain class of posets \(P\).Mathematics Subject Classifications: 06A07, 05D05Keywords: Partially ordered sets, saturation, Turán-type problems- 22 December 2023
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 3 (3)
Open AccessThe induced saturation problem for posets
For a fixed poset \(P\), a family \(\mathcal F\) of subsets of \([n]\) is induced \(P\)-saturated if \(\mathcal F\) does not contain an induced copy of \(P\), but for every subset \(S\) of \([n]\) such that \( S\not \in \mathcal F\), \(P\) is an induced subposet of \(\mathcal F \cup \{S\}\). The size of the smallest such family \(\mathcal F\) is denoted by \(\text{sat}^* (n,P)\). Keszegh, Lemons, Martin, Pálvölgyi and Patkós [Journal of Combinatorial Theory Series A, 2021] proved that there is a dichotomy of behaviour for this parameter: given any poset \(P\), either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P)\geq \log _2 n\). In this paper we improve this general result showing that either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P) \geq \min\{ 2 \sqrt{n}, n/2+1\}\). Our proof makes use of a Turán-type result for digraphs.Curiously, it remains open as to whether our result is essentially best possible or not. On the one hand, a conjecture of Ivan states that for the so-called diamond poset \(\Diamond\) we have \(\text{sat}^* (n,\Diamond)=\Theta (\sqrt{n})\); so if true this conjecture implies our result is tight up to a multiplicative constant. On the other hand, a conjecture of Keszegh, Lemons, Martin, Pálvölgyi and Patkós states that given any poset \(P\), either \(\text{sat}^* (n,P)=O(1)\) or \(\text{sat}^* (n,P)\geq n+1\). We prove that this latter conjecture is true for a certain class of posets \(P\).Mathematics Subject Classifications: 06A07, 05D05Keywords: Partially ordered sets, saturation, Turán-type problems - Open Access
On some extremal and probabilistic questions for tree posets
Given two posets $P,Q$ we say that $Q$ is $P$-free if $Q$ does not contain a copy of $P$. The size of the largest $P$-free family in $2^{[n]}$, denoted by $La(n,P)$, has been extensively studied since the 1980s. We consider several related problems. Indeed, for posets $P$ whose Hasse diagrams are trees and have radius at most $2$, we prove that there are $2^{(1+o(1))La(n,P)}$ $P$-free families in $2^{[n]}$, thereby confirming a conjecture of Gerbner, Nagy, Patkós and Vizer [Electronic Journal of Combinatorics, 2021] in these cases. For such $P$ we also resolve the random version of the $P$-free problem, thus generalising the random version of Sperner's theorem due to Balogh, Mycroft and Treglown [Journal of Combinatorial Theory Series A, 2014], and Collares Neto and Morris [Random Structures and Algorithms, 2016]. Additionally, we make a general conjecture that, roughly speaking, asserts that subfamilies of $2^{[n]}$ of size sufficiently above $La(n,P)$ robustly contain $P$, for any poset $P$ whose Hasse diagram is a tree.Open AccessOn some extremal and probabilistic questions for tree posets
Given two posets $P,Q$ we say that $Q$ is $P$-free if $Q$ does not contain a copy of $P$. The size of the largest $P$-free family in $2^{[n]}$, denoted by $La(n,P)$, has been extensively studied since the 1980s. We consider several related problems. Indeed, for posets $P$ whose Hasse diagrams are trees and have radius at most $2$, we prove that there are $2^{(1+o(1))La(n,P)}$ $P$-free families in $2^{[n]}$, thereby confirming a conjecture of Gerbner, Nagy, Patkós and Vizer [Electronic Journal of Combinatorics, 2021] in these cases. For such $P$ we also resolve the random version of the $P$-free problem, thus generalising the random version of Sperner's theorem due to Balogh, Mycroft and Treglown [Journal of Combinatorial Theory Series A, 2014], and Collares Neto and Morris [Random Structures and Algorithms, 2016]. Additionally, we make a general conjecture that, roughly speaking, asserts that subfamilies of $2^{[n]}$ of size sufficiently above $La(n,P)$ robustly contain $P$, for any poset $P$ whose Hasse diagram is a tree. - Open Access
The induced saturation problem for posets
For a fixed poset $P$, a family $\mathcal F$ of subsets of $[n]$ is induced $P$-saturated if $\mathcal F$ does not contain an induced copy of $P$, but for every subset $S$ of $[n]$ such that $ S\not \in \mathcal F$, $P$ is an induced subposet of $\mathcal F \cup \{S\}$. The size of the smallest such family $\mathcal F$ is denoted by $\text{sat}^* (n,P)$. Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os [Journal of Combinatorial Theory Series A, 2021] proved that there is a dichotomy of behaviour for this parameter: given any poset $P$, either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P)\geq \log _2 n$. In this paper we improve this general result showing that either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P) \geq \min\{ 2 \sqrt{n}, n/2+1\}$. Our proof makes use of a Tur\'an-type result for digraphs. Curiously, it remains open as to whether our result is essentially best possible or not. On the one hand, a conjecture of Ivan states that for the so-called diamond poset $\Diamond$ we have $\text{sat}^* (n,\Diamond)=\Theta (\sqrt{n})$; so if true this conjecture implies our result is tight up to a multiplicative constant. On the other hand, a conjecture of Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os states that given any poset $P$, either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P)\geq n+1$. We prove that this latter conjecture is true for a certain class of posets $P$.Open AccessThe induced saturation problem for posets
For a fixed poset $P$, a family $\mathcal F$ of subsets of $[n]$ is induced $P$-saturated if $\mathcal F$ does not contain an induced copy of $P$, but for every subset $S$ of $[n]$ such that $ S\not \in \mathcal F$, $P$ is an induced subposet of $\mathcal F \cup \{S\}$. The size of the smallest such family $\mathcal F$ is denoted by $\text{sat}^* (n,P)$. Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os [Journal of Combinatorial Theory Series A, 2021] proved that there is a dichotomy of behaviour for this parameter: given any poset $P$, either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P)\geq \log _2 n$. In this paper we improve this general result showing that either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P) \geq \min\{ 2 \sqrt{n}, n/2+1\}$. Our proof makes use of a Tur\'an-type result for digraphs. Curiously, it remains open as to whether our result is essentially best possible or not. On the one hand, a conjecture of Ivan states that for the so-called diamond poset $\Diamond$ we have $\text{sat}^* (n,\Diamond)=\Theta (\sqrt{n})$; so if true this conjecture implies our result is tight up to a multiplicative constant. On the other hand, a conjecture of Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os states that given any poset $P$, either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P)\geq n+1$. We prove that this latter conjecture is true for a certain class of posets $P$. - Open Access
- 8 November 2023
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 33 (2) , 157-178
On oriented cycles in randomly perturbed digraphs
- 8 November 2023
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 33 (2) , 157-178
Open AccessOn oriented cycles in randomly perturbed digraphs
- Open Access
Tiling edge-ordered graphs with monotone paths and other structures
Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$ has a long history, culminating in the Kühn--Osthus theorem [Combinatorica 2009] which resolves this problem, up to an additive constant, for all graphs $F$. In this paper we initiate the study of the analogous question for edge-ordered graphs. In particular, we characterize for which edge-ordered graphs $F$ this problem is well-defined. We also apply the absorbing method to asymptotically determine the minimum degree threshold for forcing a perfect $P$-tiling in an edge-ordered graph, where $P$ is any fixed monotone path.Open AccessTiling edge-ordered graphs with monotone paths and other structures
Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$ has a long history, culminating in the Kühn--Osthus theorem [Combinatorica 2009] which resolves this problem, up to an additive constant, for all graphs $F$. In this paper we initiate the study of the analogous question for edge-ordered graphs. In particular, we characterize for which edge-ordered graphs $F$ this problem is well-defined. We also apply the absorbing method to asymptotically determine the minimum degree threshold for forcing a perfect $P$-tiling in an edge-ordered graph, where $P$ is any fixed monotone path.