login
Number of labeled point-determining bipartite graphs on n vertices.
4

%I #29 Sep 13 2018 13:20:37

%S 1,1,1,3,15,135,1875,38745,1168545,50017905,3029330745,257116925835,

%T 30546104308335,5065906139629335,1172940061645387035,

%U 379092680506164049425,171204492289446788997825,108139946568584292606269025,95671942593719946611454522225

%N Number of labeled point-determining bipartite graphs on n vertices.

%C A graph is point-determining if no two vertices have the same set of neighbors. This kind of graph is also called a mating graph.

%C a(n) is always odd.

%C For every prime p > 2, a(n) is divisible by p for all n >= p. It follows that, if m is odd and squarefree with largest prime factor q, then a(n) is divisible by m for all n >= q. A similar property appears to hold for odd prime powers, in which case it would hold for all odd numbers.

%H Andrew Howroyd, <a href="/A232699/b232699.txt">Table of n, a(n) for n = 0..100</a> (terms 0..20 from Justin M. Troyka)

%H Ira Gessel and Ji Li, <a href="http://arxiv.org/abs/0705.0042">Enumeration of point-determining graphs</a>, arXiv:0705.0042 [math.CO], 2007-2009.

%H Andy Hardt, Pete McNeely, Tung Phan, and Justin M. Troyka, <a href="http://arxiv.org/abs/1312.0542">Combinatorial species and graph enumeration</a>, arXiv:1312.0542 [math.CO], 2013.

%F From _Andrew Howroyd_, Sep 09 2018: (Start)

%F a(n) = Sum_{k=0..n} Stirling1(n,k)*A047864(k).

%F E.g.f: sqrt(Sum_{k=0..n} exp(2^k*log(1+x))*log(1+x)^k/k!). (End)

%e Consider n = 3. The triangle graph is point-determining, but it is not bipartite, so it is not counted in a(3). The graph 1--2--3 is bipartite, but it is not point-determining (the vertices on the two ends have the same neighborhood), so it is also not counted in a(3). The only graph counted in a(3) is the graph *--* * (with three possible labelings). - _Justin M. Troyka_, Nov 27 2013

%t terms = 20;

%t CoefficientList[Sqrt[Sum[((1+x)^2^k Log[1+x]^k)/k!, {k, 0, terms}]] + O[x]^terms, x] Range[0, terms-1]! (* _Jean-François Alcover_, Sep 13 2018, after _Andrew Howroyd_ *)

%o (PARI) seq(n)={my(A=log(1+x+O(x*x^n))); Vec(serlaplace(sqrt(sum(k=0, n, exp(2^k*A)*A^k/k!))))} \\ _Andrew Howroyd_, Sep 09 2018

%Y Cf. A006024, A004110 (labeled and unlabeled point-determining graphs).

%Y Cf. A092430, A004108 (labeled and unlabeled connected point-determining graphs).

%Y Cf. A218090 (unlabeled point-determining bipartite graphs).

%Y Cf. A232700, A088974 (labeled and unlabeled connected point-determining bipartite graphs).

%K nonn

%O 0,4

%A _Justin M. Troyka_, Nov 27 2013