The Number of f-Matchings in Almost Every Tree is a Zero Residue
暂无分享,去创建一个
[1] Lusheng Wang,et al. The Inverse Problems for Some Topological Indices in Combinatorial Chemistry , 2003, J. Comput. Biol..
[2] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[3] M. Aigner,et al. Proofs from "The Book" , 2001 .
[4] Stephan G. Wagner. Almost All Trees have an Even Number of Independent Sets , 2009, Electron. J. Comb..
[5] R. Merrifield,et al. Topological methods in chemistry , 1989 .
[6] Martin Aigner,et al. Proofs from THE BOOK , 1998 .
[7] N. Alon,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2004 .
[8] D. Kuhn,et al. Surveys in Combinatorics 2009: Embedding large subgraphs into dense graphs , 2009, 0901.3541.
[9] Helmut Prodinger,et al. FIBONACCI NUMBERS OF GRAPHS: II , 1983 .
[10] Hiu-Fai Law. On the Number of Independent Sets in a Tree , 2010, Electron. J. Comb..
[11] Colin McDiarmid,et al. Random planar graphs , 2005, J. Comb. Theory B.
[12] A. Joyal. Une théorie combinatoire des séries formelles , 1981 .
[13] V. Linek,et al. Bipartite graphs can have any number of independent sets , 1989, Discret. Math..
[14] Kazuoki Azuma. WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .