Induced trees in triangle-free graphs

DOI10.1016/J.ENDM.2007.07.053MaRDI QIDQ5900077zbMATH OpenOpenAlexFDO

Authors Jiří Matoušek, Robert Šámal

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.07.053

zbMATH Keywords

induced subgraphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Induced trees in triangle-free graphs
• Large induced trees in \(K_r\)-free graphs
• Rooted induced trees in triangle-free graphs
• Maximum induced trees in graphs
• An improved bound on the largest induced forests for triangle-free planar graphs

Cites work

• scientific article; zbMATH DE number 2114477 (Why is no real title available?)
• Induced Ramsey numbers
• Induced trees in sparse random graphs
• Maximum induced trees in graphs
• On the order of the largest induced tree in a random graph

Cited in

(8)

• Large induced trees in \(K_r\)-free graphs
• Maximum induced trees in graphs
• Induced and weak induced arboricities
• Triangle-free graphs with no six-vertex induced path
• Rooted induced trees in triangle-free graphs
• scientific article; zbMATH DE number 4135989 (Why is no real title available?)
• Induced trees in triangle-free graphs
• The four-in-a-tree problem in triangle-free graphs

This page was built for publication: Induced trees in triangle-free graphs

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