Talk:Kotzig's conjecture
Latest comment: 1 month ago by MWinter4 in topic Additional results
Additional results
editDue to conflict of interest I left out some sources when I wrote the article. My master thesis is on the conjecture and makes some minor improvements to statements in the article.
- any two -cycles in a -graph must intersect at least five times (Section 3.2). Due to this Math.SE post they intersect at least six times. Currently the article mentions only three intersections. It mentions an assertion by Kotzig of at least seven intersections, but this was never published.
- there are some further results in the thesis about the diameter and edge count of -graphs, and that asymptotically they cannot be edge extremal without a -subgraph.