Showing math.COShow all
2 papers · 1 filter
math.CO2009
Enumeration of non-crossing pairings on bit strings
Todd Kemp, Karl Mahlburg, Amarpreet Rattan +1
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings $1^{n_1}…
math.CO2005
First Order Definability of Trees and Sparse Random Graphs
Tom Bohman, Alan Frieze, Tomasz Luczak +4
Let D(G) be the smallest quantifier depth of a first order formula which is true for a graph G but false for any other non-isomorphic graph. This can be viewed as a measure for the…