David Munhá Correia

collaborators

4 papers

math.CO2023

Cycles with many chords

Nemanja Draganić, Abhishek Methuku, David Munhá Correia +1

How many edges in an $n$ -vertex graph will force the existence of a cycle with as many chords as it has vertices? Almost 30 years ago, Chen, Erdős and Staton considered this questi…

math.CO2023

Hamilton cycles in pseudorandom graphs

Stefan Glock, David Munhá Correia, Benny Sudakov

Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$ -regular $n$ …

math.CO2023

Chvátal-Erdős condition for pancyclicity

Nemanja Draganić, David Munhá Correia, Benny Sudakov

An $n$ -vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices and it is pancyclic if it contains cycles of all lengths from $3$ up to $n$ . A celebrated…

math.CO2021

The $n$ -queens completion problem

Stefan Glock, David Munhá Correia, Benny Sudakov

An $n$ -queens configuration is a placement of $n$ mutually non-attacking queens on an $n \times n$ chessboard. The $n$ -queens completion problem, introduced by Nauck in 1850, is to…

Cycles with many chords

Hamilton cycles in pseudorandom graphs

Chvátal-Erdős condition for pancyclicity

The n-queens completion problem

The $n$ -queens completion problem