António Girão

Orcid: 0000-0002-1206-7128

According to our database1, António Girão authored at least 27 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Flashes and Rainbows in Tournaments.
Comb., June, 2024

Defective coloring of hypergraphs.
Random Struct. Algorithms, May, 2024

Induced Subgraphs of Induced Subgraphs of Large Chromatic Number.
Comb., 2024

2023
Hamiltonicity of graphs perturbed by a random regular graph.
Random Struct. Algorithms, July, 2023

2022
Strong complete minors in digraphs.
Comb. Probab. Comput., 2022

A multidimensional Ramsey Theorem.
CoRR, 2022

2021
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets.
SIAM J. Discret. Math., 2021

Subdivisions of digraphs in tournaments.
J. Comb. Theory B, 2021

Powers of paths in tournaments.
Comb. Probab. Comput., 2021

Dirac's theorem for random regular graphs.
Comb. Probab. Comput., 2021

(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked.
Comb., 2021

Hamiltonicity of random subgraphs of the hypercube.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Rainbow saturation of graphs.
J. Graph Theory, 2020

A large number of <i>m</i>-coloured complete infinite subgraphs.
J. Comb. Theory B, 2020

Disjoint pairs in set systems with restricted intersection.
Eur. J. Comb., 2020

2019
Partite Saturation of Complete Graphs.
SIAM J. Discret. Math., 2019

Partitioning a graph into monochromatic connected subgraphs.
J. Graph Theory, 2019

A precolouring extension of Vizing's theorem.
J. Graph Theory, 2019

Highly linked tournaments with large minimum out-degree.
J. Comb. Theory B, 2019

On the Maximum Diameter of Path-Pairable Graphs.
Graphs Comb., 2019

On the Maximum Degree of Path-Pairable Planar Graphs.
Electron. J. Comb., 2019

VC Dimension and a Union Theorem for Set Systems.
Electron. J. Comb., 2019

2018
Large Induced Subgraphs with k Vertices of Almost Maximum Degree.
SIAM J. Discret. Math., 2018

On a conjecture of Gentner and Rautenbach.
Discret. Math., 2018

An improved upper bound on the maximum degree of terminal-pairable complete graphs.
Discret. Math., 2018

Extension from Precoloured Sets of Edges.
Electron. J. Comb., 2018

2017
Generalized Majority Colourings of Digraphs.
Comb. Probab. Comput., 2017


  Loading...