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