The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
This work is inspired by a paper of Hertel and Pott on maximum non-linear functions [8]. Geometrically, these functions correspond with quasi-quadrics; objects introduced in [5]. ...
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...