Pages that link to "Item:Q4667860"

The following pages link to How complex are random graphs in first order logic? (Q4667860):

Displayed 6 items.

• The first order definability of graphs: Upper bounds for quantifier depth (Q860411) ‎ (← links)
• Succinct definitions in the first order theory of graphs (Q2368907) ‎ (← links)
• 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)