Related papers: Counting flags in triangle-free digraphs

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…

We prove three results conjectured or stated by Chartrand, Fink and Zhang [European J. Combin {\bf 21} (2000) 181--189, Disc. Appl. Math. {\bf 116} (2002) 115--126, and pre-print of ``The hull number of an oriented graph'']. For a digraph…

The Caccetta-H\"aggkvist conjecture implies that for every integer $k\ge 1$, if $G$ is a bipartite digraph, with $n$ vertices in each part, and every vertex has out-degree more than $n/(k+1)$, then $G$ has a directed cycle of length at most…

We identify three 3-graphs on five vertices each missing in all known extremal configurations for Turan's (3,4)-problem and prove Turan's conjecture for 3-graphs that are additionally known not to contain any induced copies of these…

Mantel's theorem states that every $n$-vertex graph with $\lfloor \frac{n^2}{4} \rfloor +t$ edges, where $t>0$, contains a triangle. The problem of determining the minimum number of triangles in such a graph is usually referred to as the…

Erd\H{o}s and Guy initiated a line of research studying $\mu_k(n)$, the minimum number of convex $k$-gons one can obtain by placing $n$ points in the plane without any three of them being collinear. Asymptotically, the limits $c_k :=…

Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique…

A well-known conjecture by Erd\H{o}s states that every triangle-free graph on $n$ vertices can be made bipartite by removing at most $n^2/25$ edges. This conjecture was known for graphs with edge density at least $0.4$ and edge density at…

One of the earliest results in extremal graph theory, Mantel's theorem, states that the maximum number of edges in a triangle-free graph $G$ on $n$ vertices is $\lfloor n^2/4 \rfloor$. We investigate how this extremal bound is affected when…

A recent conjecture of Chudnovsky and Nevo asserts that flag triangulations of spheres always have linear-sized independent sets, with a precisely conjectured proportion depending on the dimension. For dimensions one and two, the lower…

In 1963, Dirac proved that every $n$-vertex graph has $k$ vertex-disjoint triangles if $n\geq 3k$ and minimum degree $\delta(G)\geq \frac{n+k}{2}$. The base case $n=3k$ can be reduced to the Corr\'adi-Hajn\'al Theorem. Towards a rainbow…

We prove that every connected triangle-free graph on $n$ vertices contains an induced tree on $\exp(c\sqrt{\log n})$ vertices, where $c$ is a positive constant. The best known upper bound is $(2+o(1))\sqrt n$. This partially answers…

We prove a conjecture of K\"uhn, Osthus, Townsend and Zhao \cite{kuhn2017structure} stating that almost every $C_k$-free oriented graph on $n$ vertices has $\Theta(n)$ backwards edges in a transitive-optimal ordering. The same holds for…

The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper…

Let $G$ be a triangle-free graph with $n$ vertices and average degree $t$. We show that $G$ contains at least \[ e^{(1-n^{-1/12})\frac{1}{2}\frac{n}{t}\ln t (\frac{1}{2}\ln t-1)} \] independent sets. This improves a recent result of the…

It is shown that for a constant $t\in \mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges such that every edge in one set is disjoint from all edges of the other set (i.e., the…

For a subgraph $G$ of the blow-up of a graph $F$, we let $\delta^*(G)$ be the smallest minimum degree over all of the bipartite subgraphs of $G$ induced by pairs of parts that correspond to edges of $F$. In [Triangle-factors in a balanced…

In 2015, Dankelmann and Bau proved that for every bridgeless graph $G$ of order $n$ and minimum degree $\delta$ there is an orientation of diameter at most $11\frac{n}{\delta+1}+9$. In 2016, Surmacs reduced this bound to…

We prove that the ACC conjecture for minimal log discrepancies holds for threefolds in $[1-\delta,+\infty)$, where $\delta>0$ only depends on the coefficient set. We also study Reid's general elephant for pairs, and show Shokurov's…