MathDB

4

Part of 2011 Danube Mathematical Competition

Problems(1)

max no of edges a triangle-free Hamiltonian simple graph on n vertices

Source: Danube 2011 p4

7/22/2019
Given a positive integer number nn, determine the maximum number of edges a triangle-free Hamiltonian simple graph on nn vertices may have.
graphgraph theorycombinatoricsedge