3 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
For integers $k\ge 1$ and $n\ge k+2$, let $g_k(n)$ be the maximum number of edges in an $n$-vertex graph containing no cycle with a vertex incident with at least $k$ chords. Erd\H{o}s conjectured that $g_k(n)=(k+1)(n-k-1)$ for $n\ge 2k+2$. Lewin found a counterexample. Bollob\'as later conjectured that there exists a f...
A longstanding conjecture attributed to Smith (1984) asserts that for every $k\ge2$, any two longest cycles in a $k$-connected graph share at least $k$ vertices. In this paper, we prove the first linear lower bound, showing that any two longest cycles in a $k$-connected graph share at least $k/600$ vertices. Departing...
For a graph $G$, let $\cpn(G)$ and $\ccn(G)$ denote the minimum numbers of cliques whose edge sets partition and cover $E(G)$, respectively, and put $f(n)=\max_{|V(G)|=n}\bigl(\cpn(G)-\ccn(G)\bigr).$ In 1983, Erd\H{o}s, Faudree, and Ordman asked whether there is a sequence of graphs $G_n$ such that $|V(G_n)|=n$ and $\c...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
