It is shown that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but opposite arcs are permitted. The bound is sharp for each fixed oriented tree, as witnessed by disjoint unions of complete bidirected graphs....
We prove that for every integers $d \ge 1$ and $s\ge2$ there exists an integer $D$, that depends only on $d$ and $s$, such that for every graph $P$ with maximum degree at most $ d$, there is a graph $H$ with maximum degree at most $D$ in which every $s$-coloring of $V(H)$ yields a monochromatic subdivision of $P$.
Let $r \ge 2$ and $t \ge 1$. It is shown that if $T$ is an $r$-uniform tight tree with $t$ edges and $H$ is a $T$-free $r$-uniform hypergraph, then $|E(H)|\le (t-1)|\sh H|/r$, where $\sh H$ is the $(r-1)$-shadow of $H$. \iffalse Equality holds only for $(n,t + r - 2,r)$-designs.\fi The bound is tight infinitely often,...
We prove that there is an absolute positive constant $c$ such that every bipartite graph with $N$ vertices in each part and at least $N^2/2$ edges contains a complete bipartite graph $K_{t,t}$ whenever $N\ge c\, 2^{t}$. This improves the classical K\H{o}v\'ari-S\'os-Tur\'an bound requiring $N$ of order $t\,2^t $. As a...
After the initial idea for the main proof was found by the authors, various AI models were used to streamline the argument and perform the calculations necessary for completion of the proof.
J'ozsef Balogh, Andrzej Grzesik, Bernard Lidický et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.