Pages that link to "Item:Q4716329"
From MaRDI portal
The following pages link to Independence numbers of locally sparse graphs and a Ramsey type problem (Q4716329):
Displaying 25 items.
- Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014. (Q347232) (← links)
- On globally sparse Ramsey graphs (Q393934) (← links)
- Lower bounds for independence numbers of some locally sparse graphs (Q489716) (← links)
- On locally Gabriel geometric graphs (Q497339) (← links)
- Independent sets in graphs (Q501998) (← links)
- Local and global colorability of graphs (Q898084) (← links)
- On Turan's theorem for sparse graphs (Q1167183) (← links)
- On the density of subgraphs in a graph with bounded independence number (Q1272486) (← links)
- A local independence number condition for \(n\)-extendable graphs (Q1296992) (← links)
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- Randomly finding independent sets in locally sparse graphs (Q2099383) (← links)
- The independence numbers of weighted graphs with forbidden cycles (Q2151383) (← links)
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques (Q2171021) (← links)
- New bounds on the Ramsey number \(r ( I_m , L_n )\) (Q2222964) (← links)
- New lower bounds for permutation arrays using contraction (Q2324789) (← links)
- Independent transversals in locally sparse graphs (Q2384801) (← links)
- Independence and matching number of some graphs (Q2424729) (← links)
- A note on regular Ramsey graphs (Q3055921) (← links)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
- On the average size of independent sets in triangle-free graphs (Q4590969) (← links)
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers (Q4635508) (← links)
- On the independence number of sparse graphs (Q4851930) (← links)
- On Constant Time Approximation of Parameters of Bounded Degree Graphs (Q4933372) (← links)
- On independent sets in hypergraphs (Q5409863) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
