On random<i>k</i>-out subgraphs of large graphs (Q2977562): Difference between revisions

@@ Property / author @@
+Alan M. Frieze
@@ Property / author: Alan M. Frieze / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1902987962
@@ Property / OpenAlex ID: W1902987962 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2129
@@ Property / arXiv ID: 1405.2129 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in 3-out
@@ Property / cites work: Hamilton cycles in 3-out / rank @@
+Normal rank
@@ Property / cites work @@
+Expanders via Random Spanning Trees
@@ Property / cites work: Expanders via Random Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matchings in a class of random graphs
@@ Property / cites work: Maximum matchings in a class of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the connectivity of random m-orientable graphs and digraphs
+Normal rank
@@ Property / cites work @@
+On the Non-Planarity of a Random Subgraph
@@ Property / cites work: On the Non-Planarity of a Random Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+Normal rank
@@ Property / cites work @@
+Long paths and cycles in random subgraphs of graphs with large minimum degree
+Normal rank
@@ Property / cites work @@
+Robust Hamiltonicity of Dirac graphs
@@ Property / cites work: Robust Hamiltonicity of Dirac graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Packings of Hamilton Cycles in Sparse Random Graphs
+Normal rank
@@ Property / cites work @@
+One-factor in random graphs based on vertex choice
+Normal rank
@@ Property / cites work @@
+Matchings in random regular bipartite digraphs
@@ Property / cites work: Matchings in random regular bipartite digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Expected Value of a Random Assignment Problem
+Normal rank