Pages that link to "Item:Q1167183"
From MaRDI portal
The following pages link to On Turan's theorem for sparse graphs (Q1167183):
Displaying 20 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- Independence in connected graphs (Q617904) (← links)
- Interpolating between bounds on the independence number (Q708394) (← links)
- A note on the independence number of triangle-free graphs (Q1052343) (← links)
- A note on the independence number of triangle-free graphs. II (Q1186139) (← links)
- Independent sets in graphs with triangles (Q1349947) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- Independence numbers of hypergraphs with sparse neighborhoods. (Q1427433) (← links)
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- Sparse hypergraphs with low independence number (Q1705800) (← links)
- Independence and matching number of some graphs (Q2424729) (← links)
- Stable sets in flag spheres (Q2701001) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- List coloring triangle-free hypergraphs (Q3452728) (← links)
- On uncrowded hypergraphs (Q4697811) (← links)
- (Q5875468) (← links)
- Independent sets in hypergraphs omitting an intersection (Q6052482) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Packing list‐colorings (Q6185050) (← links)
