A note on the independence number of triangle-free graphs
From MaRDI portal
Publication:1052343
DOI10.1016/0012-365X(83)90273-XzbMath0516.05053MaRDI QIDQ1052343
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (86)
On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ Independence in uniform linear triangle-free hypergraphs ⋮ On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ Probabilistic methods ⋮ The list chromatic number of graphs with small clique number ⋮ Improved approximations of independent sets in bounded-degree graphs ⋮ Tough Ramsey graphs without short cycles ⋮ The independent neighborhoods process ⋮ Independent sets in graphs with triangles ⋮ A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\) ⋮ On Subgraphs of Bounded Degeneracy in Hypergraphs ⋮ Properties of regular graphs with large girth via local algorithms ⋮ The independence numbers of weighted graphs with forbidden cycles ⋮ On Ramsey numbers of uniform hypergraphs with given maximum degree ⋮ Local Clique Covering of Claw-Free Graphs ⋮ Counting independent sets in triangle-free graphs ⋮ On the Ramsey number \(r(H+\overline{K_ n},K_ n)\) ⋮ Invariant Gaussian processes and independent sets on regular graphs of large girth ⋮ On the Ramsey-Turán number with small \(s\)-independence number ⋮ The $\chi$-Ramsey Problem for Triangle-Free Graphs ⋮ Improved approximations for maximum independent set via approximation chains ⋮ On the Lovász Theta Function for Independent Sets in Sparse Graphs ⋮ Independence and matching numbers of unicyclic graphs from null space ⋮ Random cyclic triangle-free graphs of prime order ⋮ Independence ratio and random eigenvectors in transitive graphs ⋮ Bipartite induced density in triangle-free graphs ⋮ On vertex independence number of uniform hypergraphs ⋮ Independence in connected graphs ⋮ The Ramsey number R(3, t) has order of magnitude t2/log t ⋮ On the average size of independent sets in triangle-free graphs ⋮ On Brooks' Theorem for Sparse Graphs ⋮ Dynamic concentration of the triangle‐free process ⋮ Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth ⋮ Occupancy fraction, fractional colouring, and triangle fraction ⋮ Rainbow independent sets in certain classes of graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Off-diagonal book Ramsey numbers ⋮ Deterministic local algorithms, unique identifiers, and fractional graph colouring ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ Independence and matching number of some graphs ⋮ Null decomposition of unicyclic graphs ⋮ Unnamed Item ⋮ Packing list‐colorings ⋮ A note on pseudorandom Ramsey graphs ⋮ The asymptotics of \(r(4,t)\) ⋮ Ramsey-Turán problems with small independence numbers ⋮ Ramsey numbers of \(K_3\) and \(K_{n,n}\) ⋮ On the size of identifying codes in triangle-free graphs ⋮ Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability ⋮ ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS ⋮ A note concerning paths and independence number in digraphs ⋮ The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\) ⋮ Independence numbers of hypergraphs with sparse neighborhoods. ⋮ Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs ⋮ Lovász, Vectors, Graphs and Codes ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Two Conjectures in Ramsey--Turán Theory ⋮ Lower bounds for independence numbers of some locally sparse graphs ⋮ On-line list colouring of random graphs ⋮ A note on the independence number of triangle-free graphs. II ⋮ Two results on Ramsey-Turán theory ⋮ Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections ⋮ Cycles in triangle-free graphs of large chromatic number ⋮ Greed is good: Approximating independent sets in sparse and bounded-degree graphs ⋮ Approximating maximum independent sets by excluding subgraphs ⋮ On the Independence Number of Steiner Systems ⋮ On small graphs with highly imperfect powers ⋮ Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs ⋮ Triangle-free graphs whose independence number equals the degree ⋮ Maximizing H‐Colorings of a Regular Graph ⋮ An almost quadratic bound on vertex Folkman numbers ⋮ Interpolating between bounds on the independence number ⋮ Large induced forests in sparse graphs ⋮ A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs ⋮ On Ramsey numbers \(R(K_4-e, K_t)\) ⋮ Ramsey, Paper, Scissors ⋮ BIPARTITE SUBGRAPHS OF -FREE GRAPHS ⋮ The Ramsey number of the clique and the hypercube ⋮ Independent dominating sets in graphs of girth five ⋮ Counting Independent Sets in Hypergraphs ⋮ The Reverse H‐free Process for Strictly 2‐Balanced Graphs ⋮ On Some Open Questions for Ramsey and Folkman Numbers ⋮ Randomly finding independent sets in locally sparse graphs ⋮ Fractional Chromatic Number, Maximum Degree, and Girth ⋮ Ramsey Numbers for Nontrivial Berge Cycles ⋮ Phase transitions in Ramsey-Turán theory
Cites Work
This page was built for publication: A note on the independence number of triangle-free graphs
