A note on the minimum size of a vertex pancyclic graph (Q1356690): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Hajo J. Broersma / rank | |||
Property / reviewed by | |||
Property / reviewed by: Gregory Gutin / rank | |||
Property / author | |||
Property / author: Hajo J. Broersma / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Gregory Gutin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank |
Latest revision as of 14:12, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the minimum size of a vertex pancyclic graph |
scientific article |
Statements
A note on the minimum size of a vertex pancyclic graph (English)
0 references
24 September 1997
0 references
A graph \(G\) is pancyclic if every vertex of \(G\) is contained in a cycle of length \(k\) for \(3\leq k\leq n\) (\(n\) is the order of \(G\)). Let \(m_n\) denote the minimum number of edges in a vertex pancyclic graph of order \(n\). It is shown that \(m_3=3\), \(m_4=7\), \(m_6=9\), and \(\frac{3}{2}n< m_n\leq\lfloor \frac{5}{3}n\rfloor\) for \(n\geq 7\). It would be interesting to find the value of \(m_n\) for \(n\geq 7\) or to find the minimum constant \(c\) such that \(m_n\geq cn\).
0 references
minimum size
0 references
extremal problems
0 references
vertex pancyclic graph
0 references