The following pages link to On a combinatorial game (Q5905678):
Displaying 50 items.
- Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
- Economical extremal hypergraphs for the Erdős-Selfridge theorem (Q297937) (← links)
- A non-trivial upper bound on the threshold bias of the oriented-cycle game (Q345067) (← links)
- Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
- Avoider-Enforcer games played on edge disjoint hypergraphs (Q394298) (← links)
- Biased orientation games (Q418878) (← links)
- Client-waiter games on complete and random graphs (Q504971) (← links)
- On the chromatic number of non-sparse random intersection graphs (Q519889) (← links)
- Optimization with uniform size queries (Q527424) (← links)
- The picker-chooser diameter game (Q708229) (← links)
- Maker-Breaker domination game (Q776271) (← links)
- Bart--Moe games, JumbleG and discrepancy (Q875049) (← links)
- A remark on the tournament game (Q888601) (← links)
- Economical tight examples for the biased Erdős-Selfridge theorem (Q932605) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- A finite goal set in the plane which is not a winner (Q998393) (← links)
- On chooser-picker positional games (Q1044991) (← links)
- There is no fast method for finding monochromatic complete subgraphs (Q1052332) (← links)
- Van der Waerden and Ramsey type games (Q1054728) (← links)
- On a combinatorial game with an application to go-moku (Q1140042) (← links)
- On positional games (Q1149385) (← links)
- ``Integer-making'' theorems (Q1158443) (← links)
- A matching game (Q1182968) (← links)
- A characterization on \(n\)-critical economical generalized tic-tac-toe games (Q1208360) (← links)
- On-line algorithms for 2-coloring hypergraphs via chip games (Q1210300) (← links)
- Partitioning the lattice points in \(R^n\) (Q1258307) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- From Erdős to algorithms (Q1344623) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
- Approximation algorithms for the max-buying problem with limited supply (Q1755724) (← links)
- Polyomino weak achievement games on 3-dimensional rectangular boards (Q1764904) (← links)
- Optimisation and hypergraph theory (Q1813951) (← links)
- Variations on a game (Q1836601) (← links)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- Hamiltonian cycles in bipartite graphs (Q1894704) (← links)
- Combinatorial games on a graph (Q1916376) (← links)
- Some properties of non-bicolorable hypergraphs and the four-color problem (Q1917261) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Strong Ramsey games in unbounded time (Q1987092) (← links)
- Waiter-client triangle-factor game on the edges of the complete graph (Q2033901) (← links)
- Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
- Maker-breaker resolving game (Q2045245) (← links)
- A strategy for isolator in the toucher-isolator game on trees (Q2064906) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- Fast winning strategies for the maker-breaker domination game (Q2132382) (← links)
- A new bound for the Maker-Breaker triangle game (Q2143405) (← links)
- A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
- Maker-breaker total domination game (Q2185735) (← links)
