On the independence number of sparse graphs

DOI10.1002/rsa.3240070305zbMath0834.05030OpenAlexW2162218992MaRDI QIDQ4851930

James B. Shearer

Publication date: 17 October 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240070305

zbMATH Keywords

independence numberindependent setsparse graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (29)

On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ The list chromatic number of graphs with small clique number ⋮ List coloring triangle-free hypergraphs ⋮ Independent sets in graphs with triangles ⋮ On Subgraphs of Bounded Degeneracy in Hypergraphs ⋮ Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014. ⋮ Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques ⋮ On the Lovász Theta Function for Independent Sets in Sparse Graphs ⋮ Independent sets in hypergraphs omitting an intersection ⋮ On the average size of independent sets in triangle-free graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Independence and matching number of some graphs ⋮ On triangle-free list assignments ⋮ Sparse hypergraphs with low independence number ⋮ On generalized Ramsey numbers of Erdős and Rogers ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Maximum cuts in \(\mathscr{H} \)-free graphs ⋮ Independent sets in graphs ⋮ On independent sets in hypergraphs ⋮ Short Proofs of Some Extremal Results ⋮ When does the K₄‐free process stop? ⋮ Interpolating between bounds on the independence number ⋮ On Constant Time Approximation of Parameters of Bounded Degree Graphs ⋮ Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles ⋮ Separation Choosability and Dense Bipartite Induced Subgraphs ⋮ BIPARTITE SUBGRAPHS OF -FREE GRAPHS ⋮ Counting Independent Sets in Hypergraphs ⋮ On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs ⋮ Maximum bipartite subgraphs in $H$-free graphs

Cites Work

• Intersections of k-element sets

This page was built for publication: On the independence number of sparse graphs