Some Ramsey-Type Numbers and the Independence Ratio
From MaRDI portal
Publication:3864546
DOI10.2307/1998115zbMath0428.05028OpenAlexW4245619149MaRDI QIDQ3864546
Publication date: 1979
Full work available at URL: https://doi.org/10.2307/1998115
Related Items (44)
The independence number of circulant triangle-free graphs ⋮ New bounds on the independence number of connected graphs ⋮ The toughness of cubic graphs ⋮ On line graphs of subcubic triangle-free graphs ⋮ Edge density and independence ratio in triangle-free graphs with maximum degree three ⋮ Packing and covering triangles in \(K_{4}\)-free planar graphs ⋮ Finding independent sets in \(K_4\)-free 4-regular connected graphs ⋮ Triangle packings and transversals of some \(K_{4}\)-free graphs ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ Lower bounds on the independence number of certain graphs of odd girth at least seven ⋮ Independence in connected graphs ⋮ Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs ⋮ New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth ⋮ Graph classes and Ramsey numbers ⋮ Uniquely restricted matchings in subcubic graphs without short cycles ⋮ The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs ⋮ Minimizing the number of independent sets in triangle-free regular graphs ⋮ Relating the independence number and the dissociation number ⋮ Unnamed Item ⋮ Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs ⋮ Large minors in graphs with given independence number ⋮ Randomly colouring graphs (a combinatorial view) ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ On the tightness of the \(\frac {5}{14}\) independence ratio ⋮ Computing independent sets in graphs with large girth ⋮ A note on the independence number of triangle-free graphs. II ⋮ Independence, odd girth, and average degree ⋮ Independent sets in graphs ⋮ The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\) ⋮ Small 1-defective Ramsey numbers in perfect graphs ⋮ Independent sets in triangle-free cubic planar graphs ⋮ The fractional chromatic number of triangle-free subcubic graphs ⋮ Counting independent sets in cubic graphs of given girth ⋮ The independence number in graphs of maximum degree three ⋮ Large Independent Sets in Triangle-Free Planar Graphs ⋮ Bipartite subgraphs of triangle-free subcubic graphs ⋮ Multiple Domination ⋮ Exact values of defective Ramsey numbers in graph classes ⋮ On the Independence Number of Graphs with Maximum Degree 3 ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ⋮ Lower bounds on the independence number in terms of the degrees ⋮ Independence in graphs with maximum degree four ⋮ Fractional Chromatic Number, Maximum Degree, and Girth ⋮ The maximum clique problem
Cites Work
This page was built for publication: Some Ramsey-Type Numbers and the Independence Ratio
