Attila Pór

From MaRDI portal
Person:207061

Available identifiers

zbMath Open por.attilaMaRDI QIDQ207061

List of research outcomes





PublicationDate of PublicationType
Orientation preserving maps of the square grid II2024-10-25Paper
Universal sequences of lines in \(\mathbb{R}^d\)2023-10-23Paper
Erdős-Szekeres theorem for \(k\)-flats2023-05-12Paper
https://portal.mardi4nfdi.de/entity/Q50444522022-10-31Paper
A new axiomatic approach to the impartial nomination problem2021-11-24Paper
https://portal.mardi4nfdi.de/entity/Q50051732021-08-04Paper
Almost-equidistant sets2020-04-30Paper
The ropelengths of knots are almost linear in terms of their crossing numbers2020-03-25Paper
Universality of vector sequences and universality of Tverberg partitions2018-05-18Paper
Curves in \(\mathbb{R}^d\) intersecting every hyperplane at most \(d+1\) times2018-04-23Paper
An improvement on the Rado bound for the centerline depth2018-03-13Paper
Acknowledgement of priority -- a fractional Helly theorem for boxes2018-02-12Paper
Paths on the sphere without small angles2017-09-06Paper
On visibility and blockers2017-03-09Paper
Curves in \(\mathbb R^d\) intersecting every hyperplane at most \(d+1\) times2016-11-25Paper
Forcing posets with large dimension to contain large standard examples2016-06-09Paper
Standard examples as subposets of posets.2015-06-26Paper
A fractional Helly theorem for boxes2014-12-23Paper
The proof of the removable pair conjecture for fractional dimension.2014-09-04Paper
Colourful and fractional \((p,q)\)-theorems2014-07-01Paper
Thirty essays on geometric graph theory2013-09-25Paper
On the connectivity of visibility graphs2012-10-15Paper
Average crossing number, total curvature and ropelength of thick knots2012-03-13Paper
Every large point set contains many collinear points or an empty pentagon2012-01-24Paper
Destroying cycles in digraphs2011-12-20Paper
Graphs with four boundary vertices2011-02-17Paper
Paths with no small angles2010-12-03Paper
On the chromatic number of the \(\alpha\)-overlap graphs2010-09-02Paper
A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs2010-06-01Paper
Kneser representations of graphs2010-06-01Paper
Characterisation results for Steiner triple systems and their application to edge-colourings of cubic graphs2010-03-31Paper
Infinite paths with no small angles2010-02-19Paper
Lower bounding the boundary of a graph in terms of its maximum or minimum degree2009-01-28Paper
Characterization of affine Steiner triple systems and Hall triple systems2008-06-05Paper
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems2008-06-05Paper
On the computational complexity of partial covers of theta graphs2008-04-16Paper
Paths with no Small Angles2008-04-15Paper
https://portal.mardi4nfdi.de/entity/Q34396652007-05-29Paper
Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets2007-05-29Paper
No-three-in-line-in-3D2007-05-10Paper
On the positive fraction Erdős-Szekeres theorem for convex sets2006-11-15Paper
Tverberg-type theorems for separoids2006-06-14Paper
Computing and Combinatorics2006-01-11Paper
Graph Drawing2005-12-07Paper
On the chromatic number of the visibility graph of a set of points in the plane2005-11-10Paper
https://portal.mardi4nfdi.de/entity/Q46676212005-04-20Paper
A partitioned version of the Erdős-Szekeres theorem for quadrilaterals2004-03-07Paper
The partitioned version of the Erdős-Szekeres theorem2003-03-17Paper
On 0-1 polytopes with many facets2002-07-10Paper

Research outcomes over time

This page was built for person: Attila Pór