A short derivation for Turán numbers of paths

DOI10.11650/TJM/8101zbMATH Open1401.05154OpenAlexW2748843262MaRDI QIDQ1990361FDOQ1990361

Authors: Gerard Jennhwa Chang 

Publication date: 25 October 2018

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.twjm/1502935236

Recommendations

• Turán numbers for disjoint paths
• The Turán number of disjoint copies of paths
• The Turán number of the square of a path
• Turán numbers of multiple paths and equibipartite forests
• Planar Turán numbers of short paths

zbMATH Keywords

extremal graphpathTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• On maximal paths and circuits of graphs
• Title not available (Why is that?)
• On the structure of linear graphs
• Path Ramsey numbers in multicolorings
• Title not available (Why is that?)

Cited In (5)

• The Turán numbers of special forests
• Paths are Turán-good
• Turán numbers for disjoint paths
• Generalized outerplanar Turán number of short paths
• The Turán number of directed paths and oriented cycles

This page was built for publication: A short derivation for Turán numbers of paths

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