Pages that link to "Item:Q1052343"
From MaRDI portal
The following pages link to A note on the independence number of triangle-free graphs (Q1052343):
Displayed 25 items.
- Ramsey numbers of \(K_3\) and \(K_{n,n}\) (Q427617) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Independence in connected graphs (Q617904) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Interpolating between bounds on the independence number (Q708394) (← links)
- On Ramsey numbers of uniform hypergraphs with given maximum degree (Q855851) (← links)
- A note concerning paths and independence number in digraphs (Q913811) (← links)
- Triangle-free graphs whose independence number equals the degree (Q960981) (← links)
- An almost quadratic bound on vertex Folkman numbers (Q965241) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Probabilistic methods (Q1091406) (← links)
- A note on the independence number of triangle-free graphs. II (Q1186139) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
- On small graphs with highly imperfect powers (Q1198509) (← links)
- Independent sets in graphs with triangles (Q1349947) (← links)
- On the Ramsey number \(r(H+\overline{K_ n},K_ n)\) (Q1363675) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- Independence numbers of hypergraphs with sparse neighborhoods. (Q1427433) (← links)
- Tough Ramsey graphs without short cycles (Q1893953) (← links)
- Large induced forests in sparse graphs (Q2781059) (← links)
- Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections (Q3557525) (← links)
- The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> (Q4851927) (← links)
- On Brooks' Theorem for Sparse Graphs (Q4852428) (← links)
- On the Independence Number of Steiner Systems (Q4911171) (← links)
- Maximizing <i>H</i>‐Colorings of a Regular Graph (Q4920651) (← links)