On Turan's theorem for sparse graphs
From MaRDI portal
Publication:1167183
DOI10.1007/BF02579451zbMath0491.05038OpenAlexW2124088817WikidataQ105659312 ScholiaQ105659312MaRDI QIDQ1167183
Paul Erdős, Endre Szemerédi, Miklós Ajtai, János Komlós
Publication date: 1981
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579451
Related Items
The list chromatic number of graphs with small clique number, List coloring triangle-free hypergraphs, Improved approximations of independent sets in bounded-degree graphs, Independent sets in graphs with triangles, Improved approximations for maximum independent set via approximation chains, On the Lovász Theta Function for Independent Sets in Sparse Graphs, Ks-Free Graphs Without Large Kr-Free Subgraphs, On vertex independence number of uniform hypergraphs, Independence in connected graphs, Independent sets in hypergraphs omitting an intersection, Graph and hypergraph colouring via nibble methods: a survey, Independence and matching number of some graphs, Unnamed Item, Packing list‐colorings, Sparse hypergraphs with low independence number, Stable sets in flag spheres, Independence numbers of hypergraphs with sparse neighborhoods., Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A note on the independence number of triangle-free graphs. II, On the max min vertex cover problem, Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections, Interpolating between bounds on the independence number, On Constant Time Approximation of Parameters of Bounded Degree Graphs, Stable sets in flag spheres, On uncrowded hypergraphs, Counting Independent Sets in Hypergraphs, A note on the independence number of triangle-free graphs
Cites Work
