Generalized planar Turán numbers (Q2665977): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3214774009 / rank
 
Normal rank

Revision as of 02:02, 20 March 2024

scientific article
Language Label Description Also known as
English
Generalized planar Turán numbers
scientific article

    Statements

    Generalized planar Turán numbers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 November 2021
    0 references
    Summary: In a generalized Turán problem, we are given graphs \(H\) and \(F\) and seek to maximize the number of copies of \(H\) in an \(n\)-vertex graph not containing \(F\) as a subgraph. We consider generalized Turán problems where the host graph is planar. In particular, we obtain the order of magnitude of the maximum number of copies of a fixed tree in a planar graph containing no even cycle of length at most \(2\ell \), for all \(\ell\), \(\ell \geqslant 1\). We also determine the order of magnitude of the maximum number of cycles of a given length in a planar \(C_4\)-free graph. An exact result is given for the maximum number of 5-cycles in a \(C_4\)-free planar graph. Multiple conjectures are also introduced.
    0 references
    Turán problem
    0 references
    maximum number of cycles of a given length
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references