Pages that link to "Item:Q3147277"

The following pages link to Concentration for Independent Permutations (Q3147277):

Displaying 19 items.

• A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
• Asymptotically optimal frugal colouring (Q965250) (← links)
• Corrigendum to ``Asymptotically optimal frugal colouring'' [J. Comb. Theory, Ser. B 100, No. 2, 226--246 (2010)] (Q965251) (← links)
• Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree (Q1014811) (← links)
• A proof of the Barát-Thomassen conjecture (Q1989951) (← links)
• Variations on twins in permutations (Q2048547) (← links)
• A Bernstein type inequality for sums of selections from three dimensional arrays (Q2273703) (← links)
• Co-degrees resilience for perfect matchings in random hypergraphs (Q2294109) (← links)
• Stein's method for concentration inequalities (Q2369871) (← links)
• Rumor spreading on random regular graphs and expanders (Q2852547) (← links)
• KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS (Q2971036) (← links)
• An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three (Q3192373) (← links)
• Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
• Dismantling Sparse Random Graphs (Q3512603) (← links)
• A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
• Isomorphic edge disjoint subgraphs of hypergraphs (Q5740275) (← links)
• Full rainbow matchings in graphs and hypergraphs (Q5886109) (← links)