For a graph $G$, let $\nu(G)$ denote the maximum number of pairwise edge-disjoint triangles and let $\tau(G)$ denote the minimum number of edges meeting every triangle. Tuza's conjecture asserts that $\tau(G)\le 2\nu(G)$ for every graph $G$. We first note that Tuza's conjecture is equivalent to the following statement:...
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...
We prove that, for every integer $k\ge 2$, there exists a constant $c_k>0$ such that every graph on $n\ge R(k,k)$ vertices with maximum degree $\Delta$ contains an induced subgraph on at least $n-c_k\sqrt{\Delta}$ vertices whose maximum degree is attained by at least $k$ vertices. This confirms a conjecture of Caro and...
Zhen Liu, Qing-Qing Zeng· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.