The following pages link to Attila Pór (Q207061):
Displaying 49 items.
- Forcing posets with large dimension to contain large standard examples (Q293603) (← links)
- Curves in \(\mathbb R^d\) intersecting every hyperplane at most \(d+1\) times (Q343098) (← links)
- The proof of the removable pair conjecture for fractional dimension. (Q405169) (← links)
- (Q482342) (redirect page) (← links)
- A fractional Helly theorem for boxes (Q482343) (← links)
- Graphs with four boundary vertices (Q625373) (← links)
- Destroying cycles in digraphs (Q653984) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- On the connectivity of visibility graphs (Q715001) (← links)
- On the positive fraction Erdős-Szekeres theorem for convex sets (Q852711) (← links)
- No-three-in-line-in-3D (Q879952) (← links)
- Lower bounding the boundary of a graph in terms of its maximum or minimum degree (Q998400) (← links)
- A partitioned version of the Erdős-Szekeres theorem for quadrilaterals (Q1423590) (← links)
- Acknowledgement of priority -- a fractional Helly theorem for boxes (Q1693318) (← links)
- An improvement on the Rado bound for the centerline depth (Q1704902) (← links)
- The partitioned version of the Erdős-Szekeres theorem (Q1864120) (← links)
- Almost-equidistant sets (Q2175803) (← links)
- Colourful and fractional \((p,q)\)-theorems (Q2249476) (← links)
- Standard examples as subposets of posets. (Q2351724) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- Tverberg-type theorems for separoids (Q2492650) (← links)
- On the chromatic number of the visibility graph of a set of points in the plane (Q2572584) (← links)
- A new axiomatic approach to the impartial nomination problem (Q2667269) (← links)
- Blocking Colored Point Sets (Q2849797) (← links)
- On visibility and blockers (Q2968067) (← links)
- Paths with No Small Angles (Q3058524) (← links)
- AVERAGE CROSSING NUMBER, TOTAL CURVATURE AND ROPELENGTH OF THICK KNOTS (Q3224945) (← links)
- INFINITE PATHS WITH NO SMALL ANGLES (Q3406652) (← links)
- Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets (Q3439562) (← links)
- (Q3439665) (← links)
- Characterization of affine Steiner triple systems and Hall triple systems (Q3503447) (← links)
- Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems (Q3503448) (← links)
- Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs (Q3550147) (← links)
- A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs (Q3563954) (← links)
- Kneser Representations of Graphs (Q3563960) (← links)
- (Q3581666) (← links)
- Curves in Rd intersecting every hyperplane at most d + 1 times (Q4635584) (← links)
- (Q4667621) (← links)
- (Q5005173) (← links)
- (Q5044452) (← links)
- The ropelengths of knots are almost linear in terms of their crossing numbers (Q5221448) (← links)
- Paths on the Sphere Without Small Angles (Q5354949) (← links)
- Paths with no Small Angles (Q5458567) (← links)
- Graph Drawing (Q5711629) (← links)
- Computing and Combinatorics (Q5717016) (← links)
- On 0-1 polytopes with many facets (Q5945246) (← links)
- Erdős-Szekeres theorem for \(k\)-flats (Q6045791) (← links)
- Universal sequences of lines in \(\mathbb{R}^d\) (Q6076185) (← links)
- Orientation preserving maps of the square grid II (Q6624168) (← links)
