A note on the independence number of triangle-free graphs. II
From MaRDI portal
Publication:1186139
DOI10.1016/0095-8956(91)90080-4zbMath0753.05074OpenAlexW2987732947MaRDI QIDQ1186139
Publication date: 28 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(91)90080-4
Related Items
Independence in uniform linear triangle-free hypergraphs, Almost orthogonal subsets of vector spaces over finite fields, Factor of IID Percolation on Trees, The independent neighborhoods process, Independent sets in graphs with triangles, Large independent sets in regular graphs of large girth, Properties of regular graphs with large girth via local algorithms, Invariant Gaussian processes and independent sets on regular graphs of large girth, The largest transversal numbers of uniform hypergraphs, Improved approximations for maximum independent set via approximation chains, Independence ratio and random eigenvectors in transitive graphs, Lower bounds on the independence number of certain graphs of odd girth at least seven, Independence in connected graphs, New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth, The Ramsey number R(3, t) has order of magnitude t2/log t, On Brooks' Theorem for Sparse Graphs, Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth, Graph and hypergraph colouring via nibble methods: a survey, Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives, Minimizing the number of independent sets in triangle-free regular graphs, Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Cubic graphs with small independence ratio, Independence, odd girth, and average degree, Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections, Interpolating between bounds on the independence number, Hypergraph Ramsey numbers: tight cycles versus cliques, The triangle-free process, Fractional Chromatic Number, Maximum Degree, and Girth, New analytical lower bounds on the clique number of a graph
Cites Work
- An upper bound on the Ramsey numbers R(3,k)
- A note on the independence number of triangle-free graphs
- A note on Ramsey numbers
- A dense infinite Sidon sequence
- Extremal uncrowded hypergraphs
- On Turan's theorem for sparse graphs
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- A bound on the chromatic number of a graph
- Lower bounds on the independence number in terms of the degrees
- Some Ramsey-Type Numbers and the Independence Ratio
- Girth and Independence Ratio
- The Independence Ratio of Regular Graphs
