Improved bounds for the number of forests and acyclic orientations in the square lattice
From MaRDI portal
Publication:1856350
zbMath1020.05041MaRDI QIDQ1856350
Marc Noy, Criel Merino, Steven D. Noble, Neil J. Calkin
Publication date: 13 May 2003
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/122840
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Asymptotic enumeration (05A16)
Related Items
Computing the Tutte polynomial of Archimedean tilings, The replacements of signed graphs and Kauffman brackets of link families, Tutte polynomials for benzenoid systems with one branched hexagon, A general method for computing Tutte polynomials of self-similar graphs, On some Tutte polynomial sequences in the square lattice, The Tutte polynomial of some matroids, Perfect sampling methods for random forests, Tutte polynomials and related asymptotic limiting functions for recursive families of graphs, Recursively constructible families of graphs, Potts model partition functions on two families of fractal lattices, On the number of forests and connected spanning subgraphs, Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs, Study of exponential growth constants of directed heteropolygonal Archimedean lattices
