On a combinatorial game
From MaRDI portal
Publication:5905678
DOI10.1016/0097-3165(73)90005-8zbMath0293.05004WikidataQ60895467 ScholiaQ60895467MaRDI QIDQ5905678
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(73)90005-8
91A05: 2-person games
91A43: Games involving graphs
05A05: Permutations, words, matrices
05C30: Enumeration in graph theory
91A46: Combinatorial games
Related Items
Deterministic Graph Games and a Probabilistic Intuition, The Maker--Breaker Rado Game on a Random Set of Integers, A Winning Strategy for the Ramsey Graph Game, Expanders Are Universal for the Class of All Spanning Trees, Maker–Breaker percolation games I: crossing grids, Technical Note—Assortment Optimization with Small Consideration Sets, Tic-Tac-Toe on an Affine Plane of order 4, Unnamed Item, The Random Graph Intuition for the Tournament Game, Manipulative Waiters with Probabilistic Intuition, Robust Hamiltonicity of Dirac graphs, Unnamed Item, Chasing the Threshold Bias of the 3-AP Game, Waiter-Client and Client-Waiter planarity, colorability and minor games, Economical extremal hypergraphs for the Erdős-Selfridge theorem, A non-trivial upper bound on the threshold bias of the oriented-cycle game, Disproof of the neighborhood conjecture with implications to SAT, Avoider-Enforcer games played on edge disjoint hypergraphs, Biased orientation games, Client-waiter games on complete and random graphs, On the chromatic number of non-sparse random intersection graphs, Optimization with uniform size queries, The picker-chooser diameter game, Maker-Breaker domination game, Bart--Moe games, JumbleG and discrepancy, A remark on the tournament game, Economical tight examples for the biased Erdős-Selfridge theorem, Asymptotically optimal frugal colouring, A finite goal set in the plane which is not a winner, On chooser-picker positional games, There is no fast method for finding monochromatic complete subgraphs, Van der Waerden and Ramsey type games, On a combinatorial game with an application to go-moku, On positional games, ``Integer-making theorems, A matching game, A characterization on \(n\)-critical economical generalized tic-tac-toe games, On-line algorithms for 2-coloring hypergraphs via chip games, Partitioning the lattice points in \(R^n\), The probabilistic method yields deterministic parallel algorithms, From Erdős to algorithms, Weighted fractional and integral \(k\)-matching in hypergraphs, (De)randomized construction of small sample spaces in \(\mathcal{NC}\), Approximation algorithms for the max-buying problem with limited supply, Polyomino weak achievement games on 3-dimensional rectangular boards, Optimisation and hypergraph theory, Variations on a game, Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete., Finding hidden independent sets in interval graphs, Hamiltonian cycles in bipartite graphs, Combinatorial games on a graph, Some properties of non-bicolorable hypergraphs and the four-color problem, Strengthening hash families and compressive sensing, Strong Ramsey games in unbounded time, Waiter-client triangle-factor game on the edges of the complete graph, Probabilistic characterization of random Max \(r\)-Sat, Maker-breaker resolving game, A strategy for isolator in the toucher-isolator game on trees, Using the method of conditional expectations to supply an improved starting point for CCLS, Fast winning strategies for the maker-breaker domination game, A new bound for the Maker-Breaker triangle game, A novel algorithm for Max Sat calling MOCE to order, Maker-breaker total domination game, Fast strategies in Waiter-Client games, Blockers for triangulations of a convex polygon and a geometric maker-breaker game, Democratic fair allocation of indivisible goods, Maker-breaker domination number, The toucher-isolator game, Hypergraph cuts above the average, Polynomial-time computation of exact correlated equilibrium in compact games, Waiter-client and client-waiter Hamiltonicity games on random graphs, Finding fixed point free elements and small bases in permutation groups, Avoider-Enforcer games, Rectangular polyomino set weak \((1,2)\)-achievement games, Strong Ramsey games: drawing on an infinite board, Approximating the two-level facility location problem via a quasi-greedy approach, Fast winning strategies in maker-breaker games, Bases for equational theories of semi-groups, Approximation algorithms for covering/packing integer programs, On the biased \(n\)-in-a-row game, The threshold bias of the clique-factor game, The maker-breaker largest connected subgraph game, Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation, CHAMP: a multipass algorithm for Max Sat based on saver variables, Go-MOCE: greedy order method of conditional expectations for Max Sat, Thresholds for the monochromatic clique transversal game, A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals, A domination algorithm for {0,1}-instances of the travelling salesman problem, On the threshold for the Maker-BreakerH-game, Hitting time results for Maker-Breaker games, Walker-Breaker Games, Derandomized Construction of Combinatorial Batch Codes, On Ramsey-type positional games, Colouring Non-sparse Random Intersection Graphs, Ramsey, Paper, Scissors, Arithmetic Progressions and Tic-Tac-Toe Games, Winning Fast in Sparse Graph Construction Games, Remarks on positional games. I, The 𝑞-regularity of lattice point paths in 𝑅ⁿ, Discrete threshold growth dynamics are omnivorous for box neighborhoods, The accelerated \(k\)-in-a-row game, Maker-Breaker total domination game on cubic graphs, Deterministic Massively Parallel Connectivity, Multistage positional games, Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets
Cites Work
