Turán Numbers of Multiple Paths and Equibipartite Forests (Q3103631): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Erdös-Sós conjecture for graphs without \(C_ 4\) / 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: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdös-Sós conjecture for graphs of girth 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erd�s-S�s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected graphs without long paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing trees in graphs with no <i>K</i><sub>2,<i>s</i></sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic solution for a new class of forbidden r-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős‐Sós Conjecture for trees of diameter four / rank
 
Normal rank

Revision as of 18:06, 4 July 2024

scientific article
Language Label Description Also known as
English
Turán Numbers of Multiple Paths and Equibipartite Forests
scientific article

    Statements