Pages that link to "Item:Q2384807"

The following pages link to Large independent sets in regular graphs of large girth (Q2384807):

Displaying 25 items.

• 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)
• Independent sets in graphs (Q501998) (← links)
• Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees (Q511918) (← links)
• Lower bounds on the independence number of certain graphs of odd girth at least seven (Q617649) (← links)
• Perfect matchings as IID factors on non-amenable groups (Q648969) (← links)
• Interpolating between bounds on the independence number (Q708394) (← links)
• Independence ratio and random eigenvectors in transitive graphs (Q888543) (← links)
• Cubic graphs with small independence ratio (Q1733918) (← links)
• The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
• Optimal low-degree hardness of maximum independent set (Q2113266) (← links)
• A tale of two balloons (Q2689430) (← links)
• Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach (Q2971608) (← links)
• Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840) (← links)
• Invariant Gaussian processes and independent sets on regular graphs of large girth (Q3192382) (← links)
• Induced Forests in Regular Graphs with Large Girth (Q3545905) (← links)
• Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections (Q3557525) (← links)
• Independent dominating sets in graphs of girth five (Q4993127) (← links)
• Factor of IID Percolation on Trees (Q5298168) (← links)
• Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (Q6074650) (← links)
• Algorithmic obstructions in the random number partitioning problem (Q6139686) (← links)
• Borel fractional colorings of Schreier graphs (Q6159728) (← links)
• Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics (Q6203476) (← links)
• Greedy maximal independent sets via local limits (Q6541390) (← links)
• On the intersecting family process (Q6635170) (← links)