Related papers: Triangle-free triple systems

We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…

We present some results on the structure of line graphs of triangle-free graphs and a homogenization of the line graph of the universal homogeneous triangle-free graph in a finite relational language with arity 4. This result is relevant to…

We prove that every cusped hyperbolic 3-manifold has a finite cover admitting infinitely many geometric ideal triangulations. Furthermore, every long Dehn filling of one cusp in this cover admits infinitely many geometric ideal…

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

A triality is a sort of super-symmetry that exchanges the types of the elements of an incidence geometry in cycles of length three. Although geometries with trialities exhibit fascinating behaviors, their construction is challenging, making…

In this note we study curves (arrangements) in the complex projective plane which can be considered as generalizations of free curves. We construct families of arrangements which are nearly free and possess interesting geometric properties.…

We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…

In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…

In this paper we will consider the 2-fold symmetric complex hyperbolic triangle groups generated by three complex reflections through angle 2pi/p with p no smaller than 2. We will mainly concentrate on the groups where some elements are…

We show that there exist linear $3$-uniform hypergraphs with $n$ vertices and $\Omega(n^2)$ edges which contain no copy of the $3 \times 3$ grid. This makes significant progress on a conjecture of F\"{u}redi and Ruszink\'{o}. We also…

In a generalized Tur\'an problem, two graphs $H$ and $F$ are given and the question is the maximum number of copies of $H$ in an $F$-free graph of order $n$. In this paper, we study the number of double stars $S_{k,l}$ in triangle-free…

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

In optimal control problems, there exist different kinds of extremals, that is, curves candidates to be solution: abnormal, normal and strictly abnormal. The key point for this classification is how those extremals depend on the cost…

We describe first steps towards a system for automated triangle constructions in absolute and hyperbolic geometry. We discuss key differences between constructions in Euclidean, absolute and hyperbolic geometry, compile a list of primitive…

In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…

In the paper we discuss three different notions of extremal holomorphic mappings: weak $m$-extremals, $m$-extremals and $m$-complex geodesics. We discuss relations between them in general case and in the special cases of unit ball,…

In this note we show that the maximum number of edges in a $3$-uniform hypergraph without a Berge cycle of length four is at most $(1+o(1))\frac{n^{3/2}}{\sqrt{10}}$. This improves earlier estimates by Gy\H{o}ri and Lemons and by F\"uredi…

Two examples of spectral triples with non-integer dimension spectrum are considered. These triples involve commutative C*-algebras. The first example has complex dimension spectrum and trivial differential algebra. The other is a parameter…

Let $G$ be a cancellative $3$-uniform hypergraph in which the symmetric difference of any two edges is not contained in a third one. Equivalently, a $3$-uniform hypergraph $G$ is cancellative if and only if $G$ is $\{F_4, F_5\}$-free, where…

We determine the maximum number of edges in a $K_4$-minor-free $n$-vertex graph of girth $g$, when $g = 5$ or $g$ is even. We argue that there are many different $n$-vertex extremal graphs, if $n$ is even and $g$ is odd.