18 citations · 65 across the 12 of their papers we have counts for
8 papers · 1 filter
Non-reconstructible locally finite graphs
Nathan Bowler, Joshua Erde, Peter Heinig +2
Two graphs and are \emph{hypomorphic} if there exists a bijection such that for each . A graph is \em…
A counterexample to the reconstruction conjecture for locally finite trees
Nathan Bowler, Joshua Erde, Peter Heinig +2
Two graphs and are hypomorphic if there exists a bijection such that for each . A graph is reconstruc…
Logical limit laws for minor-closed classes of graphs
Peter Heinig, Tobias Muller, Marc Noy +1
Let be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at rando…
When Hamilton circuits generate the cycle space of a random graph
Peter C. Heinig
If eps > 0 and p >= n^{-1/2 + eps}, in a binomial random graph G(n,p) a.a.s. the set of cycles which can be constructed as a symmetric difference of Hamilton circuits is as large a…
On prisms, Möbius ladders and the cycle space of dense graphs
Peter C. Heinig
For a graph X, let f_0(X) denote its number of vertices, d(X) its minimum degree and Z_1(X;Z/2) its cycle space in the standard graph-theoretical sense (i.e. 1-dimensional cycle gr…
Chio Condensation and Random Sign Matrices
Peter Christian Heinig
This is to suggest a new approach to the old and open problem of counting the number f_n of Z-singular n x n matrices with entries from {-1,+1}: Comparison of two measures, none of…