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 2019Show all

5 papers · 1 filter

math.CO2019

$(2 k + 1)$ -connected tournaments with large minimum out-degree are $k$ -linked

António Girão, Kamil Popielarz, Richard Snyder

Pokrovskiy conjectured that there is a function $f : N \to N$ such that any $2 k$ -strongly-connected tournament with minimum out and in-degree at least $f(k…

math.CO2019★ 6 cited

Path and cycle decompositions of dense graphs

António Girão, Bertille Granet, Daniela Kühn +1

We make progress on three long standing conjectures from the 1960s about path and cycle decompositions of graphs. Gallai conjectured that any connected graph on $n$ vertices can be…

math.CO2019

Subdivisions of digraphs in tournaments

António Girão, Kamil Popielarz, Richard Snyder

We show that for every positive integer $k$ , any tournament with minimum out-degree at least $(2 + o (1)) k^{2}$ contains a subdivision of the complete directed graph on $k$ vertices, wh…

math.CO2019

Turán theorems for unavoidable patterns

António Girão, Bhargav Narayanan

We prove Turán-type theorems for two related Ramsey problems raised by Bollobás and by Fox and Sudakov. First, for $t \geq 3$ , we show that any two-colouring of the complete graph o…

math.CO2019

Dirac's theorem for random regular graphs

Padraig Condon, Alberto Espuny Díaz, António Girão +2

We prove a `resilience' version of Dirac's theorem in the setting of random regular graphs. More precisely, we show that, whenever $d$ is sufficiently large compared to $\varepsilo…

(2k+1)-connected tournaments with large minimum out-degree are k-linked

Path and cycle decompositions of dense graphs

Subdivisions of digraphs in tournaments

Turán theorems for unavoidable patterns

Dirac's theorem for random regular graphs

$(2 k + 1)$ -connected tournaments with large minimum out-degree are $k$ -linked