Some exact results for non-degenerate generalized Turán problems
The electronic journal of combinatorics, Tome 30 (2023) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The generalized Turán number $\mathrm{ex}(n,H,F)$ is the maximum number of copies of $H$ in $n$-vertex $F$-free graphs. We consider the case where $\chi(H)<\chi(F)$. There are several exact results on $\mathrm{ex}(n,H,F)$ when the extremal graph is a complete $(\chi(F)-1)$-partite graph. We obtain multiple exact results with other kinds of extremal graphs.
DOI : 10.37236/11574
Classification : 05C30, 05C35
Mots-clés : Turán graph, \(F\)-Turán-good graph

Dániel Gerbner  1

1 Alfred Renyi Institute of Mathematics
@article{10_37236_11574,
     author = {D\'aniel Gerbner},
     title = {Some exact results for non-degenerate generalized {Tur\'an} problems},
     journal = {The electronic journal of combinatorics},
     year = {2023},
     volume = {30},
     number = {4},
     doi = {10.37236/11574},
     zbl = {1532.05088},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/11574/}
}
TY  - JOUR
AU  - Dániel Gerbner
TI  - Some exact results for non-degenerate generalized Turán problems
JO  - The electronic journal of combinatorics
PY  - 2023
VL  - 30
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/11574/
DO  - 10.37236/11574
ID  - 10_37236_11574
ER  - 
%0 Journal Article
%A Dániel Gerbner
%T Some exact results for non-degenerate generalized Turán problems
%J The electronic journal of combinatorics
%D 2023
%V 30
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/11574/
%R 10.37236/11574
%F 10_37236_11574
Dániel Gerbner. Some exact results for non-degenerate generalized Turán problems. The electronic journal of combinatorics, Tome 30 (2023) no. 4. doi: 10.37236/11574

Cité par Sources :