Biased positional games on matroids

DOI10.1016/j.ejc.2003.12.015zbMath1099.91030OpenAlexW2048516049MaRDI QIDQ1765611

Małgorzata Bednarska, Oleg Pikhurko

Publication date: 23 February 2005

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.12.015

zbMATH Keywords

Submodular functionCycle gameRank function

Mathematics Subject Classification ID

Games involving graphs (91A43) Combinatorial games (91A46)

Related Items (10)

Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Creating cycles in walker-breaker games ⋮ Avoider-Enforcer games ⋮ A non-trivial upper bound on the threshold bias of the oriented-cycle game ⋮ MAKER–BREAKER GAMES ON AND ⋮ Odd and even cycles in maker-breaker games ⋮ On the odd cycle game and connected rules ⋮ Finding and Using Expanders in Locally Sparse Graphs ⋮ On the clique-game ⋮ The phase transition in random graphs: A simple proof

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balanced sets in an independence structure induced by a submodular function
• Directed switching games on graphs and matroids
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Submodular functions and independence structures
• Remarks on positional games. I
• Biased Positional Games
• Semimodular Functions and Combinatorial Geometries
• A Solution of the Shannon Switching Game
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• Uniform families and count matroids

This page was built for publication: Biased positional games on matroids