António Girão

activity

20142026

most citedGeneralised Majority Colourings of Digraphs

7 citations · 26 across the 38 of their papers we have counts for

collaborators

Showing 2023Show all

8 papers · 1 filter

math.CO2023

Abundance: Asymmetric Graph Removal Lemmas and Integer Solutions to Linear Equations

António Girão, Eoin Hurley, Freddie Illingworth +1

We prove that a large family of pairs of graphs satisfy a polynomial dependence in asymmetric graph removal lemmas. In particular, we give an unexpected answer to a question of Gis…

math.CO2023★ 2 cited

Induced subdivisions in $K_{s, s}$ -free graphs with polynomial average degree

António Girão, Zach Hunter

In this paper we prove that for every $s \geq 2$ and every graph $H$ the following holds. Let $G$ be a graph with average degree $Ω_{H} (s^{C ∣ H ∣^{2}})$ , for some absolute constant $C > 0$ ,…

math.CO2023★ 2 cited

Induced $C_{4}$ -free subgraphs with large average degree

Xiying Du, António Girão, Zach Hunter +2

We prove that there exists a constant $C$ so that, for all $s, k \in N$ , if $G$ has average degree at least $k^{C s^{3}}$ and does not contain $K_{s, s}$ as a subgraph then it…

math.CO2023

Flashes and rainbows in tournaments

António Girão, Freddie Illingworth, Lukas Michel +2

Colour the edges of the complete graph with vertex set ${1, 2, \dots, n}$ with an arbitrary number of colours. What is the smallest integer $f (l, k)$ such that if $n > f (l, k)$ th…

math.CO2023

Chromatic number is not tournament-local

António Girão, Kevin Hendrey, Freddie Illingworth +4

Scott and Seymour conjectured the existence of a function $f : N \to N$ such that, for every graph $G$ and tournament $T$ on the same vertex set, $χ(G) \geqs…

math.CO2023

Immersions of directed graphs in tournaments

António Girão, Robert Hancock

Recently, Draganić, Munhá Correia, Sudakov and Yuster showed that every tournament on $(2 + o (1)) k^{2}$ vertices contains a $1$ -subdivision of a transitive tournament on $k$ vertices,…

math.CO2023

A note on interval colourings of graphs

Maria Axenovich, António Girão, Lawrence Hollom +5

A graph is said to be interval colourable if it admits a proper edge-colouring using palette $N$ in which the set of colours incident to each vertex is an interval. The in…

math.CO2023

Reconstructing a point set from a random subset of its pairwise distances

António Girão, Freddie Illingworth, Lukas Michel +2

Let $V$ be a set of $n$ points on the real line. Suppose that each pairwise distance is known independently with probability $p$ . How much of $V$ can be reconstructed up to isometr…

Abundance: Asymmetric Graph Removal Lemmas and Integer Solutions to Linear Equations

Induced subdivisions in Ks,s​-free graphs with polynomial average degree

Induced C4​-free subgraphs with large average degree

Flashes and rainbows in tournaments

Chromatic number is not tournament-local

Immersions of directed graphs in tournaments

A note on interval colourings of graphs

Reconstructing a point set from a random subset of its pairwise distances

Induced subdivisions in $K_{s, s}$ -free graphs with polynomial average degree

Induced $C_{4}$ -free subgraphs with large average degree