A non-aligning variant of generalized Tur\'an problems

DOI10.1007/S00026-023-00640-8MaRDI QIDQ6376918zbMATH OpenFDO

Authors Dániel Gerbner

Publication date 5 September 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00026-023-00640-8

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35)

Abstract: In the so-called generalized Tur'an problems we study the largest number of copies of $H$ in an $n$-vertex $F$-free graph $G$. Here we introduce a variant, where $F$ is not forbidden, but we restrict how copies of $H$ and $F$ can be placed in $G$. More precisely, given an integer $n$ and graphs $H$ and $F$, what is the largest number of copies of $H$ in an $n$-vertex graph such that the vertex set of that copy does not contain and is not contained in the vertex set of a copy of $F$? We solve this problem for some instances, give bounds in other instances, and we use our results to determine the generalized Tur'an number for some pairs of graphs.

Recommendations

• On the extremal graphs in generalized Tur\'an problems
• Generalized Turán problems for disjoint copies of graphs
• Some Stability and Exact Results in Generalized Turán Problems
• Some exact results for non-degenerate generalized Turán problems

Cited in

(1)

• A localized approach to generalized Turán problems

This page was built for publication: A non-aligning variant of generalized Tur\'an problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6376918)