Combinatorial games on Galton-Watson trees involving several-generation-jump moves

DOI10.2140/CNT.2024.13.1zbMATH Open1543.91026MaRDI QIDQ6547218

Publication date: 30 May 2024

Published in: Combinatorics and Number Theory (Search for Journal in Brave)

fixed points misère games normal games two-player combinatorial games generalized finite state tree automata Poisson offspring rooted Galton-Watson trees

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Replica symmetry of the minimum matching
Trapping games on random boards
Galton-Watson probability contraction
A survey of max-type recursive distributional equations
Threshold spectra via the Ehrenfeucht game
Recursive tree processes and the mean-field limit of stochastic flows
The first order definability of graphs: Upper bounds for quantifier depth
Maximum matching and the game of Slither
Existential monadic second order logic on random rooted trees
First order sentences about random graphs: small number of alternations
A new characterization of endogeny
Complexity, appeal and challenges of combinatorial games
Frozen percolation on the binary tree is nonendogenous
A phase transition between endogeny and nonendogeny
Zero-one laws for \(k\)-variable first-order logic of sparse random graphs
Percolation games, probabilistic cellular automata, and the hard-core model
Monadic second-order properties of very sparse random graphs
On infinite spectra of first-order properties of random graphs
The first order theory of \(G(n, c/n)\)
Positional games
The first order definability of graphs with separators via the Ehrenfeucht game
First-Order Definability of Trees and Sparse Random Graphs
Short Monadic Second Order Sentences about Sparse Random Graphs
First Order Probabilities for Galton–Watson Trees
How complex are random graphs in first order logic?
Positional games on random graphs
Random unary predicates: Almost sure theories and countable models
Random tree recursions: Which fixed points correspond to tangible sets of trees?
Logical laws for short existential monadic second-order sentences about graphs
Maker‐breaker games on random geometric graphs
Biased games on random boards
Galton–Watson games

This page was built for publication: Combinatorial games on Galton-Watson trees involving several-generation-jump moves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547218)