default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntónio Girão
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]António Girão, Freddie Illingworth
, Emil Powierski, Michael Savery, Alex Scott, Youri Tamitegama, Jane Tan:
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number. Comb. 44(1): 37-62 (2024)- [j27]António Girão, Freddie Illingworth, Lukas Michel, Michael Savery, Alex D. Scott:
Flashes and Rainbows in Tournaments. Comb. 44(3): 675-690 (2024) - [j26]Maria Axenovich, António Girão, Lawrence Hollom, Julien Portier, Emil Powierski, Michael Savery, Youri Tamitegama, Leo Versteegen:
A note on interval colourings of graphs. Eur. J. Comb. 120: 103956 (2024) - [j25]António Girão, Robert Hancock:
Two Ramsey problems in blowups of graphs. Eur. J. Comb. 120: 103984 (2024) - [j24]António Girão, Kevin Hendrey, Freddie Illingworth, Florian Lehner, Lukas Michel, Michael Savery, Raphael Steiner:
Chromatic number is not tournament-local. J. Comb. Theory B 168: 86-95 (2024) - [j23]António Girão, Freddie Illingworth, Alex D. Scott, David R. Wood:
Defective coloring of hypergraphs. Random Struct. Algorithms 64(3): 663-675 (2024) - 2023
- [j22]Alberto Espuny Díaz, António Girão:
Hamiltonicity of graphs perturbed by a random regular graph. Random Struct. Algorithms 62(4): 857-886 (2023) - 2022
- [j21]Maria Axenovich, António Girão, Richard Snyder, Lea Weber:
Strong complete minors in digraphs. Comb. Probab. Comput. 31(3): 489-506 (2022) - [i2]António Girão, Gal Kronenberg, Alex Scott:
A multidimensional Ramsey Theorem. CoRR abs/2210.09227 (2022) - 2021
- [j20]António Girão, Kamil Popielarz, Richard Snyder:
(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked. Comb. 41(6): 815-837 (2021) - [j19]Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus:
Dirac's theorem for random regular graphs. Comb. Probab. Comput. 30(1): 17-36 (2021) - [j18]Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov:
Powers of paths in tournaments. Comb. Probab. Comput. 30(6): 894-898 (2021) - [j17]António Girão, Kamil Popielarz, Richard Snyder:
Subdivisions of digraphs in tournaments. J. Comb. Theory B 146: 266-285 (2021) - [j16]Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt:
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. SIAM J. Discret. Math. 35(2): 915-927 (2021) - [c1]Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus:
Hamiltonicity of random subgraphs of the hypercube. SODA 2021: 889-898 - 2020
- [j15]António Girão, Richard Snyder:
Disjoint pairs in set systems with restricted intersection. Eur. J. Comb. 83 (2020) - [j14]António Girão:
A large number of m-coloured complete infinite subgraphs. J. Comb. Theory B 142: 80-105 (2020) - [j13]António Girão, David Lewis, Kamil Popielarz:
Rainbow saturation of graphs. J. Graph Theory 94(3): 421-444 (2020) - [i1]Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt:
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. CoRR abs/2001.06367 (2020)
2010 – 2019
- 2019
- [j12]António Girão, Gábor Mészáros, Kamil Popielarz, Richard Snyder:
On the Maximum Degree of Path-Pairable Planar Graphs. Electron. J. Comb. 26(2): 2 (2019) - [j11]Stijn Cambie, António Girão, Ross J. Kang:
VC Dimension and a Union Theorem for Set Systems. Electron. J. Comb. 26(3): 3 (2019) - [j10]António Girão, Kamil Popielarz, Gábor Mészáros, Richard Snyder:
On the Maximum Diameter of Path-Pairable Graphs. Graphs Comb. 35(6): 1647-1657 (2019) - [j9]António Girão, Richard Snyder:
Highly linked tournaments with large minimum out-degree. J. Comb. Theory B 139: 251-266 (2019) - [j8]António Girão, Shoham Letzter, Julian Sahasrabudhe:
Partitioning a graph into monochromatic connected subgraphs. J. Graph Theory 91(4): 353-364 (2019) - [j7]António Girão, Ross J. Kang:
A precolouring extension of Vizing's theorem. J. Graph Theory 92(3): 255-260 (2019) - [j6]António Girão, Teeradej Kittipassorn, Kamil Popielarz:
Partite Saturation of Complete Graphs. SIAM J. Discret. Math. 33(4): 2346-2359 (2019) - 2018
- [j5]Katherine Edwards, António Girão, Jan van den Heuvel, Ross J. Kang, Gregory J. Puleo, Jean-Sébastien Sereni:
Extension from Precoloured Sets of Edges. Electron. J. Comb. 25(3): 3 (2018) - [j4]António Girão, Gábor Mészáros, Stephen G. Z. Smith:
On a conjecture of Gentner and Rautenbach. Discret. Math. 341(4): 1094-1097 (2018) - [j3]António Girão, Gábor Mészáros:
An improved upper bound on the maximum degree of terminal-pairable complete graphs. Discret. Math. 341(9): 2606-2607 (2018) - [j2]António Girão, Kamil Popielarz:
Large Induced Subgraphs with k Vertices of Almost Maximum Degree. SIAM J. Discret. Math. 32(1): 450-454 (2018) - 2017
- [j1]António Girão, Teeradej Kittipassorn, Kamil Popielarz:
Generalized Majority Colourings of Digraphs. Comb. Probab. Comput. 26(6): 850-855 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
