Skip to content
Preprint

Sharp asymptotics for triangle independence and covering numbers

Aug 2026 · 0 citations · 6 references
Mathematics

Abstract

For a graph $G$, let $\alpha_1(G)$ be the maximum size of an edge set containing at most one edge from every triangle, and let $\tau_1(G)$ be the minimum size of an edge set meeting every triangle. Erd\H{o}s, Gallai, and Tuza proved that $\alpha_1(G)+\tau_1(G)=\Omega(m^{2/3})$ for every $m$-edge graph and asked for the optimal asymptotic constant. We prove $$\lim_{m\to\infty} \min_{G,\,|E(G)|=m} \frac{\alpha_1(G) + \tau_1(G)}{m^{2/3}} = \frac{3}{2},$$ thereby establishing that the sharp constant is $3/2$ and solving the problem.

View source

Similar papers

Preprint Sep 2026

Sparse Approximate Chromatic Profiles of Triangle-Free Graphs

We prove a sparse version of the four-colour theorem of Brandt and Thomass\'{e}, answering a question of Allen, B\"ottcher, Kohayakawa and Roberts. For every fixed $0<\gamma\le1/10$ and every $p=p(n)\in(0,1]$, asymptotically almost surely every spanning triangle-free $H\subseteq G(n,p)$ with $\delta(H)\ge(1/3+\gamma)pn...

Guo-Rong Gao, Jia-Lin He · 0 citations
Preprint Sep 2026

An extremal theorem for non-isomorphic spanning trees

For a graph $G$, let $\tau_{\mathrm{iso}}(G)$ denote the number of isomorphism classes of its spanning trees. For every fixed $d\ge3$ and all sufficiently large $n$, we prove that every connected $n$-vertex graph $G$ with $\delta(G)\ge d$ satisfies \[\tau_{\mathrm{iso}}(G)\ge \tau_{\mathrm{iso}}(K_{d,n-d})=A_dn^{d-1}+O...

Zhi-Fei Yan, Lu-Ming Zhang · 0 citations
Preprint Aug 2026

Clique-saturating non-edges throughout the Tur\'an range

For an $F$-free graph $G$, a non-edge is $F$-saturating if adding it to $G$ creates a copy of $F$. We denote by $f_{p+1}(n,m)$ the minimum number of $K_{p+1}$-saturating non-edges in a $K_{p+1}$-free $n$-vertex graph with $m$ edges. Erd\H{o}s and Tuza conjectured that $f_4\left(n,\mathrm{ex}(n,K_3)+ 1\right)= (1 + o(1)...

Xiao-Lin Wang, Jia-Bao Yang, Rui-Lin Zheng · 0 citations
Preprint Sep 2026

A maximum matching based refinement of Brouwers conjecture

Let $G$ be a simple graph on $n$ vertices and $e(G)$ edges. Let $\mu_1\geq \cdots \geq \mu_{n-1}\geq \mu_n=0$ be the Laplacian eigenvalues of $G$. For $k=1, \ldots, n$, let $S_k(G)=\sum_{i=1}^{k}\mu_i$. Brouwers conjecture asserts that for any $k\in\{1,\ldots, n\}$, $S_k(G)\leq e(G)+\binom{k+1}{2}$. In [Bounding the su...

Tahir Shamsher · 0 citations
Preprint Aug 2026

The Erd\H{o}s four-edge intersection problem

For an $n$-vertex graph $G$ and a permutation $\sigma$ of its vertex set, let $\sigma(G)$ denote the corresponding relabelling of $G$, and put \[ I_G(\sigma)=|E(G)\cap E(\sigma(G))|. \] Let $f(n,k)$ be the minimum number of edges in an $n$-vertex graph for which $I_G(\sigma)\geq k$ for every $\sigma$. In 1977 Erd\H{o}s...

Andrzej Żak · 0 citations
Preprint Sep 2026

Maximum and Minimum Spectral Radii in an Exceptional Family for Edge-Disjoint Spanning Trees

For a connected graph $G$, let $\tau(G)$ denote the maximum number of pairwise edge-disjoint spanning trees, and let $\rho(G)$ be its adjacency spectral radius. For integers $n\ge1$, $k\ge2$, and $k\le\delta\le2k-1$, let $\mathcal{G}_{n,\delta}$ be the class of connected $n$-vertex graphs with minimum degree $\delta$,...

Xuan-Yu Cao, Chun-Xiang Wang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.