Induced forests in some distance-regular graphs

DOI10.1016/j.dam.2023.12.003arXiv2301.05207OpenAlexW4390238367MaRDI QIDQ6153467

Karen Meagher, Karen Gunderson, Venkata Raghu Tej Pantangi, Joy Morris

Publication date: 14 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.05207

zbMATH Keywords

distance-regular graphsinduced forestsacyclic number1-degenerate subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Feedback vertex set in hypercubes
• Large induced trees in \(K_r\)-free graphs
• Maximum induced trees in graphs
• The Erdős-Ko-Rado theorem for vector spaces
• On the order of the largest induced tree in a random graph
• Large induced degenerate subgraphs
• Maximum induced forests of planar graphs
• Induced matchings
• Problems and results in extremal combinatorics. I.
• Decycling hypercubes
• Interlacing eigenvalues and graphs
• A new bound on the feedback vertex sets in cubic graphs
• Maximum induced forests in random graphs
• Large induced forests in sparse graphs
• Rooted induced trees in triangle-free graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Induced Forests in Regular Graphs with Large Girth
• Lower Bounds For Induced Forests in Cubic Graphs
• Size of the largest induced forest in subcubic graphs of girth at least four and five
• Decycling numbers of random regular graphs
• Refined estimates concerning sumsets contained in the roots of unity
• Short Proofs of Some Extremal Results
• Large Induced Matchings in Random Graphs
• Induced trees in triangle-free graphs

This page was built for publication: Induced forests in some distance-regular graphs