On a combinatorial game

From MaRDI portal
Revision as of 07:28, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5905678


DOI10.1016/0097-3165(73)90005-8zbMath0293.05004OpenAlexW2008120342WikidataQ60895467 ScholiaQ60895467MaRDI QIDQ5905678

Paul Erdős, John L. Selfridge

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



Related Items

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



Cites Work