conjecture about disjoint cycles (2009)
Nicolas Lichiardopol, Attila Pór, Jean-sébastien Sereni
Bermond-Thomassen
Maximizing Maximal Angles for Plane Straight-Line Graphs ⋆ (2009)
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, ...
Abstract. Let G =(S, E) be a plane straight-line graph on a finite point set S ⊂ R 2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges of G that...
Every Large Point Set contains Many Collinear Points or an Empty Pentagon (2009)
Abel, Zachary, Ballinger, Brad, Bose, Prosenjit, Collette, Sébastien, Dujmović, Vida, Hurtado, Ferran, ...
We prove the following generalised empty pentagon theorem: for every integer $\ell \geq 2$, every sufficiently large set of points in the plane contains $\ell$ collinear points or an empty pentagon....
DOI: 10.1007/s00453-006-0158-9 No-Three-in-Line-in-3D 1 (2008)
Abstract. The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. Erdős proved that the answer is...
Ricardo Strausz, Czeck Republic, Attila Pór
Let S be a d-dimensional separoid of (k − 1)(d + 1) + 1 convex sets in some ‘large-dimensional ’ Euclidean space IE N. We prove a theorem that can be interpreted as follows: if the separoid S...
Daniel Král, Edita Máčajová, Attila Pór, Jean-sébastien Sereni
Characterization results for Steiner triple
conjecture about disjoint cycles (2008)
Nicolas Lichiardopol, Attila Pór, Jean-sébastien Sereni
Bermond-Thomassen
Daniel Král, Edita Máčajová, Attila Pór, Jean-sébastien Sereni
Characterization results for Steiner triple
Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets (2005)
Let $F$ be a family of connected bipartite graphs, each with at least three vertices. A proper vertex colouring of a graph $G$ with no bichromatic subgraph in $F$ is $\F$-free. The $F$-free chromatic...
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erdös proved that the answer is \Theta...
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erdös proved that the answer is \Theta...
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erdös proved that the answer is \Theta...
Track Layouts of Graphs (2004)
Vida Dujmović, Attila Pór, David R. Wood
A (k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour...
On linear layouts of graphs (2003)
Vida Dujmović, Attila Pór, David R. Wood
A (k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour...