On the independence number of sparse graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(48)- On a problem of Spencer
- On Turan's theorem for sparse graphs
- The independence number of dense graphs with large odd girth
- The independence number of graphs with large odd girth
- 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 the minimum degree of minimal Ramsey graphs for multiple colours
- All maximal independent sets and dynamic dominance for sparse graphs
- A note on regular Ramsey graphs
- On subgraphs of bounded degeneracy in hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- List coloring triangle-free hypergraphs
- Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014.
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- scientific article; zbMATH DE number 4049676 (Why is no real title available?)
- On the number of sparse connected graphs
- scientific article; zbMATH DE number 1503636 (Why is no real title available?)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs
- On the average size of independent sets in triangle-free graphs
- On generalized Ramsey numbers of Erdős and Rogers
- Independence numbers of locally sparse graphs and a Ramsey type problem
- On the $b$ -Independence Number of Sparse Random Graphs
- Lower bounds for independence numbers of some locally sparse graphs
- On constant time approximation of parameters of bounded degree graphs
- Bipartite subgraphs of H-free graphs
- Independent sets in graphs
- Separation choosability and dense bipartite induced subgraphs
- On independent sets in hypergraphs
- Short proofs of some extremal results
- When does the \(K_{4}\)-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 triangle-free list assignments
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- Coloring locally sparse graphs
- Independent sets in hypergraphs
- A note on large cliques in complex networks -- a Ramsey theory approach
- Random independent sets in triangle-free graphs
- On the order of the classical Erdős-Rogers functions
- Interpolating between bounds on the independence number
- The representation number of some sparse graphs
This page was built for publication: On the independence number of sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4851930)
