Some bounds on the size of maximum G-free sets in graphs

DOI10.1142/s1793830922501324zbMath1516.05179arXiv2201.04333OpenAlexW4291014513WikidataQ114071630 ScholiaQ114071630MaRDI QIDQ6174763

Yaser Rowshan

Publication date: 15 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

independence numberforest number\(G\)-free coloring\(G\)-free subset

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• A new lower bound on the independence number of a graph and applications
• On the maximum induced forests of a connected cubic graph without triangles
• Graphs with unique maximum independent sets
• The complexity of \(G\)-free colourability
• A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
• Large induced forests in sparse graphs
• Independence, odd girth, and average degree
• Decycling graphs
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• Decycling numbers of random regular graphs
• The number of maximum independent sets in graphs
• Nordhaus–Gaddum problem in terms of G-free coloring

This page was built for publication: Some bounds on the size of maximum G-free sets in graphs