default search action
Andrew Treglown
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j46]Balázs Patkós, Andrew Treglown:
On Some Extremal and Probabilistic Questions for Tree Posets. Electron. J. Comb. 31(1) (2024) - [j45]Igor Araujo, József Balogh, Robert A. Krueger, Simón Piga
, Andrew Treglown:
On oriented cycles in randomly perturbed digraphs. Comb. Probab. Comput. 33(2): 157-178 (2024) - [j44]Igor Araujo
Tiling Edge-Ordered Graphs with Monotone Paths and Other Structures. SIAM J. Discret. Math. 38(2): 1808-1839 (2024) - [j43]József Balogh, Andrew Treglown, Camila Zárate-Guerén:
A Note on Color-Bias Perfect Matchings in Hypergraphs. SIAM J. Discret. Math. 38(4): 2543-2552 (2024) - 2023
- [j42]Andrea Freschi, Simón Piga, Maryam Sharifzadeh, Andrew Treglown:
The induced saturation problem for posets. Comb. Theory 3(3) (2023) - 2022
- [j41]Nathanaël Hassler, Andrew Treglown:
On Maximal Sum-Free Sets in Abelian Groups. Electron. J. Comb. 29(2) (2022) - [j40]Andrea Freschi
On deficiency problems for graphs. Comb. Probab. Comput. 31(3): 478-488 (2022) - [j39]Allan Lo, Andrew Treglown, Yi Zhao:
Complete subgraphs in a multipartite graph. Comb. Probab. Comput. 31(6): 1092-1101 (2022) - [j38]A. Nicholas Day, Victor Falgas-Ravry, Andrew Treglown:
Extremal problems for multigraphs. J. Comb. Theory B 154: 1-48 (2022) - [j37]József Balogh, Lina Li, Andrew Treglown:
Tilings in vertex ordered graphs. J. Comb. Theory B 155: 171-201 (2022) - [j36]Robert Hancock, Andrew Treglown:
An asymmetric random Rado theorem for single equations: The 0-statement. Random Struct. Algorithms 60(4): 529-550 (2022) - 2021
- [j35]József Balogh, Béla Csaba, András Pluhár, Andrew Treglown:
A discrepancy version of the Hajnal-Szemerédi theorem. Comb. Probab. Comput. 30(3): 444-459 (2021) - [j34]Jie Han, Patrick Morris
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu. Random Struct. Algorithms 58(3): 480-516 (2021) - [j33]Louis DeBiasio
Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree. SIAM J. Discret. Math. 35(1): 250-266 (2021) - [j32]Andrea Freschi
A Note on Color-Bias Hamilton Cycles in Dense Graphs. SIAM J. Discret. Math. 35(2): 970-975 (2021) - 2020
- [j31]Joseph Hyde, Andrew Treglown:
A Degree Sequence Version of the Kühn-Osthus Tiling Theorem. Electron. J. Comb. 27(3): 3 (2020) - [j30]Shagnik Das
Ramsey properties of randomly perturbed graphs: cliques and cycles. Comb. Probab. Comput. 29(6): 830-867 (2020) - [j29]Jie Han, Andrew Treglown:
The complexity of perfect matchings and packings in dense hypergraphs. J. Comb. Theory B 141: 72-104 (2020) - [j28]Shagnik Das
Vertex Ramsey properties of randomly perturbed graphs. Random Struct. Algorithms 57(4): 983-1006 (2020) - [j27]Victor Falgas-Ravry
Existence thresholds and Ramsey properties of random posets. Random Struct. Algorithms 57(4): 1097-1133 (2020)
2010 – 2019
- 2019
- [j26]József Balogh, Andrew Treglown, Zsolt Adam Wagner:
Tilings in Randomly Perturbed Dense Graphs. Comb. Probab. Comput. 28(2): 159-176 (2019) - [j25]Robert Hancock, Katherine Staden, Andrew Treglown:
Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers. SIAM J. Discret. Math. 33(1): 153-188 (2019) - [j24]Joseph Hyde, Hong Liu
A Degree Sequence Komlós Theorem. SIAM J. Discret. Math. 33(4): 2041-2061 (2019) - [c1]Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown:
Preface. BCC 2019: vii-viii - [e1]Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown:
Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29 - August 2, 2019. Cambridge University Press 2019, ISBN 978-1-108-74072-2 [contents] - 2018
- [j23]Kitty Meeks
On the complexity of finding and counting solution-free sets of integers. Discret. Appl. Math. 243: 219-238 (2018) - 2017
- [j22]Jie Han
Exact Minimum Codegree Threshold for K - 4-Factors. Comb. Probab. Comput. 26(6): 856-885 (2017) - [j21]Robert Hancock, Andrew Treglown:
On solution-free sets of integers. Eur. J. Comb. 66: 110-128 (2017) - [j20]Katherine Staden, Andrew Treglown:
On Degree Sequences Forcing The Square of a Hamilton Cycle. SIAM J. Discret. Math. 31(1): 383-437 (2017) - [i1]Kitty Meeks, Andrew Treglown:
On the complexity of finding and counting solution-free sets of integers. CoRR abs/1704.03758 (2017) - 2016
- [j19]Andrew Treglown, Yi Zhao:
A Note on Perfect Matchings in Uniform Hypergraphs. Electron. J. Comb. 23(1): 1 (2016) - [j18]Robert Hancock, Andrew Treglown:
Enumerating solution-free sets in the integers. Electron. Notes Discret. Math. 56: 21-30 (2016) - [j17]Andrew Treglown:
A degree sequence Hajnal-Szemerédi theorem. J. Comb. Theory B 118: 13-43 (2016) - [j16]József Balogh, Andrew Treglown, Zsolt Adam Wagner:
Applications of graph containers in the Boolean lattice. Random Struct. Algorithms 49(4): 845-872 (2016) - 2015
- [j15]Andrew Treglown:
On Directed Versions of the Hajnal-Szemerédi Theorem. Comb. Probab. Comput. 24(6): 873-928 (2015) - [j14]József Balogh, Hong Liu, Maryam Sharifzadeh, Andrew Treglown:
A sharp bound on the number of maximal sum-free sets. Electron. Notes Discret. Math. 49: 57-64 (2015) - [j13]Katherine Staden, Andrew Treglown:
On a degree sequence analogue of Pósa's conjecture. Electron. Notes Discret. Math. 49: 233-241 (2015) - 2014
- [j12]József Balogh, Richard Mycroft, Andrew Treglown:
A random version of Sperner's theorem. J. Comb. Theory A 128: 104-110 (2014) - 2013
- [j11]József Balogh, Alexandr V. Kostochka, Andrew Treglown:
On Perfect Packings in Dense Graphs. Electron. J. Comb. 20(1): 57 (2013) - [j10]Fiachra Knox, Andrew Treglown:
Embedding Spanning Bipartite Graphs of Small Bandwidth. Comb. Probab. Comput. 22(1): 71-96 (2013) - [j9]Daniela Kühn, Deryk Osthus, Andrew Treglown:
Matchings in 3-uniform hypergraphs. J. Comb. Theory B 103(2): 291-305 (2013) - [j8]James Cummings
Monochromatic triangles in three-coloured graphs. J. Comb. Theory B 103(4): 489-503 (2013) - [j7]Andrew Treglown, Yi Zhao:
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II. J. Comb. Theory A 120(7): 1463-1482 (2013) - 2012
- [j6]Andrew Treglown, Yi Zhao:
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. J. Comb. Theory A 119(7): 1500-1522 (2012) - [j5]Andrew Treglown:
A note on some embedding problems for oriented graphs. J. Graph Theory 69(3): 330-336 (2012) - 2011
- [j4]Andrew Treglown, Daniela Kühn, Deryk Osthus:
Matchings in 3-uniform hypergraphs of large minimum vertex degree. Electron. Notes Discret. Math. 38: 813-818 (2011) - 2010
- [j3]Daniela Kühn, Deryk Osthus, Andrew Treglown:
Hamiltonian degree sequences in digraphs. J. Comb. Theory B 100(4): 367-380 (2010)
2000 – 2009
- 2009
- [j2]Daniela Kühn, Deryk Osthus, Andrew Treglown:
Degree sequences forcing Hamilton cycles in directed graphs. Electron. Notes Discret. Math. 34: 347-351 (2009) - [j1]Daniela Kühn, Deryk Osthus, Andrew Treglown:
An Ore-type Theorem for Perfect Packings in Graphs. SIAM J. Discret. Math. 23(3): 1335-1355 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: