Extremal number of theta graphs of order 7
For a set of graphs F , let H(n; F ) denote the class of non-bipartite Hamiltonian graphs on n vertices that does not contain any graph of F as a subgraph and h(n; F ) = max{E (G) : G E H(n; F )} where E (G) is the number of edges in G. In this paper we determine h(n; {84, 85, 87}) and h(n; 87) f...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sociedade Brasileira de Matemática
2020-10-01
|
| Series: | Boletim da Sociedade Paranaense de Matemática |
| Online Access: | https://periodicos.uem.br/ojs/index.php/BSocParanMat/article/view/41921 |