For a graph $G$, denote by $a(G)$ the number of vertices in the largest induced forest in $G$. The Albertson-Berman conjecture, which had been open since 1979, states that $a(G) \geq \frac{n}{2}$ for every simple planar graph $G$ on $n$ vertices. Although the Albertson-Berman conjecture was recently resolved in the negative by constructing a counterexample with the help of AI, we independently found a counterexample to the Albertson-Berman conjecture without AI and present it in this article. Our counterexample is on $39$ vertices with $a(G)=19$. Finally, we indicate, without a full proof, a variant of this construction with a larger number of vertices, but with a slightly smaller ratio $\frac{a(G)}{n}=\frac{37}{76}$.
For a graph $G$, let $a(G)$ be the maximum number of vertices in an induced forest. The Albertson-Berman conjecture, posed in 1979, asserts that every $n$-vertex planar graph satisfies $a(G)\ge n/2$. Borodin's bound $a(G)\ge 2n/5$ remains the general lower bound toward this problem. We disprove the conjecture with an e...
In 1979, Albertson and Berman conjectured that every planar graph $G$ contains an induced forest of order at least $|V(G)|/2$. This long-standing conjecture was recently disproved by several explicit counterexamples, which naturally led to several extremal and structural questions that we answer. We combine mathematica...
Wouter Cames van Batenburg, J. Goedgebeur, Jorik Jooken· 0 citations
An $n$-vertex graph $G$ is $(\rho, d)$-dense if for all $U \subseteq V(G)$ of size at least $\rho n$, the induced subgraph $G[U]$ contains at least $\frac{d}{2}|U|^2$ edges. In 2010, partly motivated by the theory of quasirandomness, Kohayakawa, Nagle, R\"{o}dl, and Schacht conjectured that, for any fixed graph $F$, th...
For a graph $F$ with at least one edge, a $k$-uniform hypergraph is Berge-$F$-saturated if it contains no Berge-$F$, but adding any missing hyperedge creates a Berge-$F$. The saturation number $\text{sat}_k(n,\text{Berge-}F)$ is the minimum number of edges in such a hypergraph on $n$ vertices. English, Gordon, Graber,...
Let $G$ be a simple graph on $n$ vertices, and let $F(G)$ denote the number of its spanning forests. Bencs and Csikv\'ari [Upper bound for the number of spanning forests of regular graphs, European J. Combin. 110 (2023) 103677] proved that every $r$-regular graph $G$ with $r\geq 2$ satisfies $F(G) \leq r^{n}$. They fur...
Ting-Zeng Wu, S. Lu, Xiang-Shuai Dong· 0 citations
Given graphs $H$ and $F$, the generalized Tur\'{a}n number ${\rm ex}(n,H,F)$ is the maximum number of copies of $H$ in an $n$-vertex $F$-free graph. Alon and Shikhelman (J. Combin. Theory Ser. B, 2016) initiated the systematic study of generalized Tur\'{a}n problems. Recently, Gao, Wu and Xue (J. Graph Theory, 2026) as...
Junpeng Zhou, Xi-Ying Yuan· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.