Pages that link to "Item:Q3438138"
From MaRDI portal
The following pages link to First-Order Definability of Trees and Sparse Random Graphs (Q3438138):
Displaying 8 items.
- Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
- Characterization of product anti-magic graphs of large order (Q2478164) (← links)
- The complexity of random ordered structures (Q2478557) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- (Q3787513) (← links)
- First-order properties of trees, star-free expressions, and aperiodicity (Q3978766) (← links)
- How complex are random graphs in first order logic? (Q4667860) (← links)
- Combinatorial games on Galton-Watson trees involving several-generation-jump moves (Q6547218) (← links)