The Turán number of disjoint copies of paths (Q2374168): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1511.07679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected graphs without long paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turàn number of the graph 3P4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán Numbers of Multiple Paths and Equibipartite Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán Numbers for Forests of Paths in Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof for a conjecture of Gorgol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Ramsey numbers in multicolorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Numbers for Odd Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph Turán numbers of linear cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The History of Degenerate (Bipartite) Extremal Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán numbers for disjoint copies of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3089368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán problems and shadows. I: Paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Turán number of forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Complete Subgraphs in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of Turán problems for expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank

Latest revision as of 02:50, 13 July 2024

scientific article
Language Label Description Also known as
English
The Turán number of disjoint copies of paths
scientific article

    Statements

    The Turán number of disjoint copies of paths (English)
    0 references
    0 references
    0 references
    14 December 2016
    0 references
    Turán number
    0 references
    extremal graph
    0 references
    disjoint path
    0 references

    Identifiers