Pages that link to "Item:Q5313025"

The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313025):

Displaying 22 items.

• The cook-book approach to the differential equation method (Q465658) (← links)
• On the chromatic number of random regular graphs (Q896008) (← links)
• An upper bound on adaptable choosability of graphs (Q1003583) (← links)
• On the chromatic number of random \(d\)-regular graphs (Q1043497) (← links)
• Random regular graphs of non-constant degree: concentration of the chromatic number (Q1043588) (← links)
• On the independence and chromatic numbers of random regular graphs (Q1186131) (← links)
• Distinguishing chromatic number of random Cayley graphs (Q2012532) (← links)
• On the chromatic number of the preferential attachment graph (Q2033902) (← links)
• Two notions of unit distance graphs (Q2451892) (← links)
• Lower bounds on the chromatic number of random graphs (Q2678448) (← links)
• Random regular graphs of high degree (Q2746213) (← links)
• Hadwiger number and chromatic number for near regular degree sequences (Q3055914) (← links)
• Regular graphs with prescribed chromatic number (Q3470480) (← links)
• The t-improper chromatic number of random graphs (Q3503499) (← links)
• Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models (Q3608304) (← links)
• Decoding from Pooled Data: Sharp Information-Theoretic Bounds (Q5025779) (← links)
• The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5232321) (← links)
• Planting Colourings Silently (Q5366948) (← links)
• MAX <i>k</i>‐CUT and approximating the chromatic number of random graphs (Q5471049) (← links)
• The Ising Antiferromagnet and Max Cut on Random Regular Graphs (Q5864219) (← links)
• The two possible values of the chromatic number of a random graph (Q5901081) (← links)
• The chromatic number of random graphs (Q5905438) (← links)