On the structure of extremal graphs of high girth

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199711)26:3<147::AID-JGT5>3.0.CO;2-R" /><147::AID-JGT5>3.0.CO;2-R 10.1002/(SICI)1097-0118(199711)26:3<147::AID-JGT5>3.0.CO;2-RzbMath0883.05077OpenAlexW2028300942MaRDI QIDQ4364808

Felix Lazebnik, Ping Wang

Publication date: 22 February 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199711)26:3<147::aid-jgt5>3.0.co;2-r

zbMATH Keywords

girthextremal graphstructure

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (11)

The NIP graph of a social welfare function ⋮ Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\) ⋮ Size of Graphs with High Girth ⋮ Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs ⋮ Graphs with maximum size and lower bounded girth ⋮ General properties of some families of graphs defined by systems of equations ⋮ Unnamed Item ⋮ On the girth of extremal graphs without shortest cycles ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) ⋮ Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\) ⋮ On extremal bipartite graphs with high girth

This page was built for publication: On the structure of extremal graphs of high girth