Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded ...
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and ...
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
Michael Domaratzki, Alexander Okhotin, Jeffrey Sha...