Pages that link to "Item:Q1186139"

The following pages link to A note on the independence number of triangle-free graphs. II (Q1186139):

Displaying 30 items.

• Independence in uniform linear triangle-free hypergraphs (Q279201) (← links)
• The independent neighborhoods process (Q312273) (← links)
• Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
• New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth (Q400363) (← links)
• Lower bounds on the independence number of certain graphs of odd girth at least seven (Q617649) (← links)
• Independence in connected graphs (Q617904) (← links)
• Interpolating between bounds on the independence number (Q708394) (← links)
• Independence ratio and random eigenvectors in transitive graphs (Q888543) (← links)
• The triangle-free process (Q1023043) (← links)
• Independent sets in graphs with triangles (Q1349947) (← links)
• Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
• Minimizing the number of independent sets in triangle-free regular graphs (Q1690246) (← links)
• Cubic graphs with small independence ratio (Q1733918) (← links)
• The largest transversal numbers of uniform hypergraphs (Q1910524) (← links)
• Almost orthogonal subsets of vector spaces over finite fields (Q2136196) (← links)
• Large independent sets in regular graphs of large girth (Q2384807) (← links)
• Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives (Q2421880) (← links)
• Hypergraph Ramsey numbers: tight cycles versus cliques (Q2788661) (← links)
• Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach (Q2971608) (← links)
• Independence, odd girth, and average degree (Q3005112) (← links)
• Invariant Gaussian processes and independent sets on regular graphs of large girth (Q3192382) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← 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>²/log <i>t</i> (Q4851927) (← links)
• On Brooks' Theorem for Sparse Graphs (Q4852428) (← links)
• Fractional Chromatic Number, Maximum Degree, and Girth (Q5013575) (← links)
• New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
• Factor of IID Percolation on Trees (Q5298168) (← links)
• Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (Q6074650) (← links)
• Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)