相关论文: A note on Erd\H{o}s's mysterious remark

Let L be a simple Euclidean arrangement of n pseudolines. It is shown that if L has exactly one (>=5)=gon P, and k is the number of edges of P that are adjacent to an unbounded cell of the subarrangement of L induced by the pseudolines in…

We show that every heptagon is a section of a $3$-polytope with $6$ vertices. This implies that every $n$-gon with $n\geq 7$ can be obtained as a section of a $(2+\lfloor\frac{n}{7}\rfloor)$-dimensional polytope with at most…

A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…

We prove that in every $2$-edge-colouring of $K_n$ there is a collection of $n^2/12 + o(n^2)$ edge-disjoint monochromatic triangles, thus confirming a conjecture of Erd\H{o}s. We also prove a corresponding stability result, showing that…

We show that a dense subset of a sufficiently large group multiplication table contains either a large part of the addition table of the integers modulo some $k$, or the entire multiplication table of a certain large abelian group, as a…

A point set $S \subseteq \mathbb{R}^2$ is universal for a class $\cal G$ if every graph of ${\cal G}$ has a planar straight-line embedding on $S$. It is well-known that the integer grid is a quadratic-size universal point set for planar…

We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…

Let $f$ be an orientation preserving homeomorphism of $S^2$ which has a (nontrivial) continuum $X$ as a minimal set. Then there are exactly two connected components of $S^2\setminus X$ which are left invariant by $f$ and all the others are…

A folklore result attributed to P\'olya states that there are $(1 + o(1))2^{\binom{n}{2}}/n!$ non-isomorphic graphs on $n$ vertices. Given two graphs $G$ and $H$, we say that $G$ is a unique subgraph of $H$ if $H$ contains exactly one…

Using the formalism of flag algebras, we prove that every triangle-free graph $G$ with $n$ vertices contains at most $(n/5)^5$ cycles of length five. Moreover, the equality is attained only when $n$ is divisible by five and $G$ is the…

The Serre conjecture II predicts that every torsor under a semisimple, simply connected, algebraic group over a field of cohomological dimension at most 2 and of degree of imperfection at most 1 has a rational point. We generalize this…

In 2018, Sz\"{o}ll\H{o}si and \"{O}sterg\r{a}rd used a computer to enumerate sets of equiangular lines with common angle $\arccos(1/3)$ in dimension $7$. They observed that the numbers $\omega(n)$ of sets of $n$ equiangular lines with…

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…

The Erdos-Szekeres theorem states that for any natural k there is a natural number g(k) such that any set of at least g(k) points on a plane in general position contains a set of k points that are the extreme points of a convex polytope. We…

There are four characteristic circles for each triangle on a plane. All for are tangential to the three straight lines containing the triangles' three sides. Three are exterior circles, the fourth is the in-circle. When the triangle is…

The five simple exceptional complex Lie superalgbras of vector fields are described. One of them is new; the other four are explicitely described for the first time. All of the exceptional Lie superalgebras are obtained with the help of the…

The first open case of the Brown, Erd\H{o}s, S\'os conjecture is equivalent to the following; For every $c>0$ there is a threshold $n_0$ so that if a quasigroup has order $n\geq n_0$ then for every subset of triples of the form $(a,b,ab),$…

We prove that every 3-regular graph with no circuit of length less than six has a subgraph isomorphic to a subdivision of the Petersen graph.

Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer a planar subgraph of $G$. In this paper we show that…