A Solution of the Shannon Switching Game
From MaRDI portal
Publication:5511877
DOI10.1137/0112059zbMath0137.38704OpenAlexW2127402154MaRDI QIDQ5511877
Publication date: 1964
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0112059
Applications of graph theory (05C90) Games involving graphs (91A43) Analytic circuit theory (94C05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Idealness of k-wise Intersecting Families, Spanning Structures in Walker–Breaker Games, Clean Clutters and Dyadic Fractional Packings, Infinite Matroids, On combinatorial properties of binary spaces, \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs, MAKER–BREAKER GAMES ON AND, Bipartite secret sharing and staircases, Multistage positional games, Manipulative Waiters with Probabilistic Intuition, Unnamed Item, Spanning-Tree Games., On ideal clutters, metrics and multiflows, Component Games on Regular Graphs, Positional games on random graphs, Playing to Retain the Advantage, Opposite Elements in Clutters, On Four Problems in Graph Theory, Maker–Breaker percolation games I: crossing grids, Maker‐breaker games on random geometric graphs, Biased games on random boards, Efficient Winning Strategies in Random‐Turn Maker–Breaker Games, Matroidal games, Waiter-Client and Client-Waiter planarity, colorability and minor games, Characterization of even directed graphs, Fast Strategies In Maker–Breaker Games Played on Random Boards, Avoider-Enforcer games, Binary group and Chinese postman polyhedra, A solution to the Box Game, Delta Minors, Delta Free Clutters, and Entanglement, A note on biased and non-biased games, Hitting time results for Maker-Breaker games, Winning fast in fair biased maker-breaker games, Generating random graphs in biased Maker-Breaker games, Directed switching games. II: The arborescence game, Lehman's Theorem and the Directed Steiner Tree Problem, Recognizing max-flow min-cut path matrices, Topological games at Princeton, a mathematical memoir, A solution of the misère Shannon switching game, A threshold for the Maker-Breaker clique game, Characterizations of finitary and cofinitary binary matroids, Polyhedra of regular p-nary group problems, Functions computed by monotone Boolean formulas with no repeated variables, Independence and port oracles for matroids, with an application to computational learning theory, Clean tangled clutters, simplices, and projective geometries, How fast can maker win in fair biased games?, On the WalkerMaker-WalkerBreaker games, Random-player maker-breaker games, Global maker-breaker games on sparse graphs, \(l\)-matrices and a characterization of binary matroids, Infinite subgraphs as matroid circuits, From clutters to matroids, Deltas, extended odd holes and their blockers, Fast winning strategies in positional games, Matroid representation over GF(3), Fast strategies in Waiter-Client games, Hex and combinatorics, Ideal multipartite secret sharing schemes, Ideal hierarchical secret sharing and lattice path matroids, Theory of connexes. I, A simple approach to some basic results in matroid theory, Principal partition of graphs and connectivity games, The switching game on unions of oriented matroids, Indicated coloring of matroids, Forests, frames, and games: Algorithms for matroid sums and applications, Graphs without proper subgraphs of minimum degree 3 and short cycles, Maker-breaker percolation games. II: Escaping to infinity, Clutters and circuits, Cuboids, a class of clutters, Client-waiter games on complete and random graphs, Shannon switching games without terminals. III, Extending Brickell-Davenport theorem to non-perfect secret sharing schemes, Fractional arboricity, strength, and principal partitions in graphs and matroids, Ideal clutters, Geography, Keeping avoider's graph almost acyclic, Biased positional games on matroids, Edge-disjoint spanning trees and depth-first search, A composition for matroids, Clutter nonidealness, The principal minors of a matroid, Independent transversals for countable set systems, A circuit covering result for matroids, On maximally distant spanning trees of a graph, The diameter game, Asymptotic random graph intuition for the biased connectivity game, On secret sharing schemes, matroids and polymatroids, Game edge-connectivity of graphs, How many circuits determine an oriented matroid?, Chords and disjoint paths in matroids, Matroids, generalized networks, and electric network synthesis, A sharp threshold for the Hamilton cycle Maker–Breaker game, Weak and strong \(k\)-connectivity games, Orientability of matroids, The matroids with the max-flow min-cut property, A note on the production of matroid minors, Theory of division games, Connector-breaker games on random boards, A product of matroids and its automorphism group, Ideal secret sharing schemes whose minimal qualified subsets have at most three participants, Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs, Shannon switching games without terminals. II, Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids, Clutters and circuits. II, Structural theorems for submodular functions, polymatroids and polymatroid intersections, On subgraphs as matroid cells, On matroids with few circuits containing a pair of elements, Four problems on graphs with excluded minors, Ideal Hierarchical Secret Sharing Schemes, Matroids with a unique non-common circuit containing a fixed element, Maker-Breaker domination game, The directed switching game on Lawrence oriented matroids, Variations on a game, Computational Complexity of Coherent Systems and the Reliability Polynomial, On chooser-picker positional games, Playing to retain the advantage, Van der Waerden and Ramsey type games, Cycle games and cycle cut games, A characterization of weakly bipartite graphs, Directed switching games on graphs and matroids, Idealness of \(k\)-wise intersecting families, Waiter-client and client-waiter Hamiltonicity games on random graphs
