The following pages link to Dan Hefetz (Q271621):
Displaying 50 items.
- Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
- Picker-chooser fixed graph games (Q273174) (← links)
- On degree anti-Ramsey numbers (Q338572) (← links)
- A hypergraph Turán theorem via Lagrangians of intersecting families (Q388725) (← links)
- Doubly biased maker-breaker connectivity game (Q426836) (← links)
- Fast embedding of spanning trees in biased maker-breaker games (Q427795) (← links)
- Optimal covers with Hamilton cycles in random graphs (Q484550) (← links)
- On saturation games (Q499485) (← links)
- Winning strong games through fast strategies for weak games (Q553998) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- Hamilton cycles in highly connected and expanding graphs (Q624184) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Fast winning strategies in avoider-enforcer games (Q844236) (← links)
- Bart--Moe games, JumbleG and discrepancy (Q875049) (← links)
- Avoider-enforcer: the rules of the game (Q966059) (← links)
- On two problems regarding the Hamiltonian cycle game (Q1010935) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
- Polynomial lower bound for distributed graph coloring in a weak LOCAL model (Q1660925) (← links)
- Small rainbow cliques in randomly perturbed dense graphs (Q2065991) (← links)
- Semi-random process without replacement (Q2112738) (← links)
- On the local structure of oriented graphs -- a case study in flag algebras (Q2170792) (← links)
- Waiter-client and client-waiter Hamiltonicity games on random graphs (Q2357219) (← links)
- Avoider-Enforcer games (Q2371294) (← links)
- Strong Ramsey games: drawing on an infinite board (Q2397109) (← links)
- Positional games (Q2438527) (← links)
- Weak and strong \(k\)-connectivity games (Q2509746) (← links)
- Fast winning strategies in maker-breaker games (Q2519013) (← links)
- Random directed graphs are robustly Hamiltonian (Q2820274) (← links)
- Avoider-Enforcer: The Rules of the Game (Q2851474) (← links)
- Playing to retain the advantage (Q2851498) (← links)
- Fast embedding of spanning trees in biased Maker-Breaker games (Q2857367) (← links)
- Hitting time results for Maker-Breaker games (Q2909241) (← links)
- Building Spanning Trees Quickly in Maker-Breaker Games (Q2947437) (← links)
- On antimagic directed graphs (Q3055919) (← links)
- An Application of the combinatorial Nullstellensatz to a graph labelling problem (Q3055927) (← links)
- Sharp threshold for the appearance of certain spanning trees in random graphs (Q3145834) (← links)
- Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process (Q3386520) (← links)
- Fast winning strategies in positional games (Q3503475) (← links)
- A sharp threshold for the Hamilton cycle Maker–Breaker game (Q3608315) (← links)
- Planarity, Colorability, and Minor Games (Q3614201) (← links)
- Playing to Retain the Advantage (Q4933596) (← links)
- Edge-statistics on large graphs (Q4993086) (← links)
- Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs (Q5001845) (← links)
- Spanning-Tree Games. (Q5005136) (← links)
- Large Rainbow Cliques in Randomly Perturbed Dense Graphs (Q5055643) (← links)
- Semi‐random graph process (Q5113951) (← links)
- Very fast construction of bounded-degree spanning graphs via the semi-random graph process (Q5146812) (← links)
- (Q5365089) (← links)
- Universality of Graphs with Few Triangles and Anti-Triangles (Q5366905) (← links)
- Manipulative Waiters with Probabilistic Intuition (Q5366922) (← links)
