Andrew Treglown

Andrew Treglown

University of Birmingham

H-index: 19

Europe-United Kingdom

About Andrew Treglown

Andrew Treglown, With an exceptional h-index of 19 and a recent h-index of 14 (since 2020), a distinguished researcher at University of Birmingham, specializes in the field of Combinatorics and its applications.

His recent articles reflect a diverse array of research interests and contributions to the field:

On oriented cycles in randomly perturbed digraphs

A note on colour-bias perfect matchings in hypergraphs

A general bound for the induced poset saturation problem

Tiling problems in edge-ordered graphs

Cycles of every length and orientation in randomly perturbed digraphs

Tiling edge-ordered graphs with monotone paths and other structures

On some extremal and probabilistic questions for tree posets

Dirac-type results for tilings and coverings in ordered graphs

Andrew Treglown Information

University

Position

___

Citations(all)

1049

Citations(since 2020)

632

Cited By

711

hIndex(all)

19

hIndex(since 2020)

14

i10Index(all)

30

i10Index(since 2020)

23

Email

University Profile Page

Google Scholar

Andrew Treglown Skills & Research Interests

Combinatorics and its applications

Top articles of Andrew Treglown

Title

Journal

Author(s)

Publication Date

On oriented cycles in randomly perturbed digraphs

Combinatorics, Probability and Computing

Igor Araujo

József Balogh

Robert A Krueger

Simón Piga

Andrew Treglown

2024/3

A note on colour-bias perfect matchings in hypergraphs

arXiv preprint arXiv:2401.17073

József Balogh

Andrew Treglown

Camila Zárate-Guerén

2024/1/30

A general bound for the induced poset saturation problem

European Conference on Combinatorics, Graph Theory and Applications

Andrea Freschi

Simon Piga

Maryam Sharifzadeh

Andrew Treglown

2023/8/28

Tiling problems in edge-ordered graphs

European Conference on Combinatorics, Graph Theory and Applications

Igor Araujo

Simón Piga

Andrew Treglown

Zimu Xiang

2023/8/28

Cycles of every length and orientation in randomly perturbed digraphs

European Conference on Combinatorics, Graph Theory and Applications

Igor Araujo

József Balogh

Robert Krueger

Simón Piga

Andrew Treglown

2023/6/16

Tiling edge-ordered graphs with monotone paths and other structures

arXiv preprint arXiv:2305.07294

Igor Araujo

Simón Piga

Andrew Treglown

Zimu Xiang

2023/5/12

On some extremal and probabilistic questions for tree posets

arXiv preprint arXiv:2308.14863

Balázs Patkós

Andrew Treglown

2023/8/28

Dirac-type results for tilings and coverings in ordered graphs

Forum of Mathematics, Sigma

Andrea Freschi

Andrew Treglown

2022/1

The induced saturation problem for posets

arXiv preprint arXiv:2207.03974

Andrea Freschi

Simón Piga

Maryam Sharifzadeh

Andrew Treglown

2022/7/8

Tilings in vertex ordered graphs

Journal of Combinatorial Theory, Series B

József Balogh

Lina Li

Andrew Treglown

2022/7/1

An asymmetric random Rado theorem for single equations: The 0‐statement

Random Structures & Algorithms

Robert Hancock

Andrew Treglown

2022/7

On deficiency problems for graphs

Combinatorics, Probability and Computing

Andrea Freschi

Joseph Hyde

Andrew Treglown

2022/5

Extremal problems for multigraphs

Journal of Combinatorial Theory, Series B

A Nicholas Day

Victor Falgas-Ravry

Andrew Treglown

2022/5/1

Complete subgraphs in a multipartite graph

Combinatorics, Probability and Computing

Allan Lo

Andrew Treglown

Yi Zhao

2022/11

Transitive tournament tilings in oriented graphs with large minimum total degree

SIAM Journal on Discrete Mathematics

Louis DeBiasio

Allan Lo

Theodore Molla

Andrew Treglown

2021

On maximal sum-free sets in abelian groups

arXiv preprint arXiv:2108.04615

Nathanaël Hassler

Andrew Treglown

2021/8/10

A discrepancy version of the Hajnal–Szemerédi theorem

Combinatorics, Probability and Computing

József Balogh

Béla Csaba

András Pluhár

Andrew Treglown

2021/5

Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu

Random Structures & Algorithms

Jie Han

Patrick Morris

Andrew Treglown

2021/5

A note on color-bias Hamilton cycles in dense graphs

SIAM Journal on Discrete Mathematics

Andrea Freschi

Joseph Hyde

Joanna Lada

Andrew Treglown

2021

The bandwidth theorem for locally dense graphs

Forum of Mathematics, Sigma

Katherine Staden

Andrew Treglown

2020/1

See List of Professors in Andrew Treglown University(University of Birmingham)