António Girão

activity

20172022

most citedA note on long powers of paths in tournaments

2 citations · 4 across the 6 of their papers we have counts for

collaborators

22 papers

math.CO2022

A note on unavoidable patterns in locally dense colourings

António Girão, David Munhá Correia

We show that there is a constant $C$ such that for every $ε > 0$ any $2$ -coloured $K_{n}$ with minimum degree at least $n /4 + ε n$ in both colours contains a complete…

math.CO2021★ 1 cited

Tiling with monochromatic bipartite graphs of bounded maximum degree

António Girão, Oliver Janzer

We prove that for any $r \in N$ , there exists a constant $C_{r}$ such that the following is true. Let $F = {F_{1}, F_{2}, \dots}$ be an infinite sequence of bipartite gra…

math.CO2021

Powers of paths and cycles in tournaments

António Girão, Dániel Korándi, Alex Scott

We show that for every positive integer $k$ , any tournament can be partitioned into at most $2^{c k}$ $k$ -th powers of paths. This result is tight up to the exponential constant. Mo…

math.CO2020

Strong complete minors in digraphs

Maria Axenovich, António Girão, Richard Snyder +1

Kostochka and Thomason independently showed that any graph with average degree $Ω (r lo g r)$ contains a $K_{r}$ minor. In particular, any graph with chromatic number $Ω(r\sqrt{…

math.CO2020★ 2 cited

A note on long powers of paths in tournaments

António Girão

A square of a path on $k$ vertices is a directed path $x_{1} \dots x_{k}$ , where $x_{i}$ is directed to $x_{i + 2}$ , for every $i \in {1, \dots, k - 1}$ . Recently, Yuster showed that any to…

math.CO2020

Powers of paths in tournaments

Nemanja Draganić, François Dross, Jacob Fox +7

In this short note we prove that every tournament contains the $k$ -th power of a directed path of linear length. This improves upon recent results of Yuster and of Girão. We also g…