The following pages link to Asaf Ferber (Q247214):
Displaying 50 items.
- Almost-spanning universality in random graphs (extended abstract) (Q322227) (← links)
- Counting and packing Hamilton cycles in dense graphs and oriented graphs (Q345082) (← links)
- Avoider-Enforcer games played on edge disjoint hypergraphs (Q394298) (← links)
- Fast embedding of spanning trees in biased maker-breaker games (Q427795) (← links)
- Strong games played on random graphs (Q510354) (← links)
- Winning strong games through fast strategies for weak games (Q553998) (← links)
- On almost precipitous ideals (Q964452) (← links)
- The biased odd cycle game (Q1953485) (← links)
- Singularity of random symmetric matrices -- simple proof (Q1979880) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- Dirac-type theorems in random hypergraphs (Q2131868) (← links)
- Every graph contains a linearly sized induced subgraph with all degrees odd (Q2161306) (← links)
- Lower bounds for multicolor Ramsey numbers (Q2219333) (← links)
- Number of 1-factorizations of regular high-degree graphs (Q2220965) (← links)
- Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs (Q2260636) (← links)
- Co-degrees resilience for perfect matchings in random hypergraphs (Q2294109) (← links)
- Robust Hamiltonicity of random directed graphs (Q2399348) (← links)
- Weak and strong \(k\)-connectivity games (Q2509746) (← links)
- On a conjecture of Thomassen (Q2517648) (← links)
- Packing spanning graphs from separable families (Q2628001) (← links)
- Universality of random graphs and rainbow embedding (Q2811163) (← links)
- Fast embedding of spanning trees in biased Maker-Breaker games (Q2857367) (← links)
- Hitting time results for Maker-Breaker games (Q2909241) (← links)
- A Construction of Almost Steiner Systems (Q2935201) (← links)
- Building Spanning Trees Quickly in Maker-Breaker Games (Q2947437) (← links)
- Rainbow Hamilton cycles in random graphs and hypergraphs (Q2957179) (← links)
- Fast Strategies In Maker–Breaker Games Played on Random Boards (Q3168447) (← links)
- Generating random graphs in biased Maker-Breaker games (Q3460510) (← links)
- Counting Hamilton cycles in sparse random directed graphs (Q4625019) (← links)
- Spanning universality in random graphs (Q4625020) (← links)
- Law of the iterated logarithm for random graphs (Q4625027) (← links)
- Packing perfect matchings in random hypergraphs (Q4642740) (← links)
- Packing trees of unbounded degrees in random graphs (Q4967960) (← links)
- A quantitative Lovász criterion for Property B (Q4993116) (← links)
- Resilience of the rank of random matrices (Q4993256) (← links)
- On the counting problem in inverse Littlewood–Offord theory (Q5006328) (← links)
- List-Decodability With Large Radius for Reed-Solomon Codes (Q5088510) (← links)
- Almost all Steiner triple systems are almost resolvable (Q5135409) (← links)
- 1‐Factorizations of pseudorandom graphs (Q5136914) (← links)
- SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS (Q5197490) (← links)
- Supersaturated Sparse Graphs and Hypergraphs (Q5216319) (← links)
- Long Monotone Trails in Random Edge-Labellings of Random Graphs (Q5222568) (← links)
- Counting Hamilton Decompositions of Oriented Graphs (Q5233804) (← links)
- Optimal threshold for a random graph to be 2-universal (Q5234488) (← links)
- Biased games on random boards (Q5265341) (← links)
- Efficient Winning Strategies in Random‐Turn Maker–Breaker Games (Q5272928) (← links)
- Robust hamiltonicity of random directed graphs <i>extended abstract</i> (Q5363063) (← links)
- (Q5365089) (← links)
- Embedding large graphs into a random graph (Q5371058) (← links)
- Packing Loose Hamilton Cycles (Q5373831) (← links)
