Pages that link to "Item:Q5511877"
From MaRDI portal
The following pages link to A Solution of the Shannon Switching Game (Q5511877):
Displaying 50 items.
- Clutters and circuits. II (Q1271872) (← links)
- Directed switching games. II: The arborescence game (Q1356760) (← links)
- \(l\)-matrices and a characterization of binary matroids (Q1394232) (← links)
- Graphs without proper subgraphs of minimum degree 3 and short cycles (Q1743173) (← links)
- Biased positional games on matroids (Q1765611) (← links)
- How many circuits determine an oriented matroid? (Q1786051) (← links)
- Shannon switching games without terminals. II (Q1812789) (← links)
- Four problems on graphs with excluded minors (Q1823871) (← links)
- Variations on a game (Q1836601) (← links)
- A characterization of weakly bipartite graphs (Q1850558) (← links)
- A note on biased and non-biased games (Q1894371) (← links)
- Independence and port oracles for matroids, with an application to computational learning theory (Q1924488) (← links)
- Maker-breaker percolation games. II: Escaping to infinity (Q1984532) (← links)
- Cuboids, a class of clutters (Q1985449) (← links)
- Game edge-connectivity of graphs (Q2028096) (← links)
- Connector-breaker games on random boards (Q2040008) (← links)
- Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
- On the WalkerMaker-WalkerBreaker games (Q2181217) (← links)
- Fast strategies in Waiter-Client games (Q2200433) (← links)
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes (Q2256110) (← links)
- Keeping avoider's graph almost acyclic (Q2260635) (← links)
- Waiter-client and client-waiter Hamiltonicity games on random graphs (Q2357219) (← links)
- Avoider-Enforcer games (Q2371294) (← links)
- Topological games at Princeton, a mathematical memoir (Q2389292) (← links)
- How fast can maker win in fair biased games? (Q2411594) (← links)
- Deltas, extended odd holes and their blockers (Q2421555) (← links)
- Hex and combinatorics (Q2433713) (← links)
- Clutter nonidealness (Q2492208) (← links)
- Weak and strong \(k\)-connectivity games (Q2509746) (← links)
- On subgraphs as matroid cells (Q2548961) (← links)
- Clean tangled clutters, simplices, and projective geometries (Q2668014) (← links)
- Ideal hierarchical secret sharing and lattice path matroids (Q2697480) (← links)
- Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids (Q2820860) (← links)
- Playing to retain the advantage (Q2851498) (← links)
- Hitting time results for Maker-Breaker games (Q2909241) (← links)
- A threshold for the Maker-Breaker clique game (Q2925528) (← links)
- The diameter game (Q3055780) (← links)
- Asymptotic random graph intuition for the biased connectivity game (Q3055785) (← links)
- On secret sharing schemes, matroids and polymatroids (Q3056338) (← links)
- Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs (Q3081327) (← links)
- Fast Strategies In Maker–Breaker Games Played on Random Boards (Q3168447) (← links)
- Delta Minors, Delta Free Clutters, and Entanglement (Q3177442) (← links)
- Ideal Hierarchical Secret Sharing Schemes (Q3408196) (← links)
- Computational Complexity of Coherent Systems and the Reliability Polynomial (Q3415905) (← links)
- Generating random graphs in biased Maker-Breaker games (Q3460510) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- Fast winning strategies in positional games (Q3503475) (← links)
- A sharp threshold for the Hamilton cycle Maker–Breaker game (Q3608315) (← links)
- Binary group and Chinese postman polyhedra (Q3717740) (← links)
- A circuit covering result for matroids (Q3856783) (← links)
