论文信息 - Sieve methods in combinatorics

Sieve methods in combinatorics

We develop the Turan sieve and a 'simple sieve' in the context of bipartite graphs and apply them to various problems in combinatorics. More precisely, we provide applications in the cases of characters of abelian groups, vertex-colourings of graphs, Latin squares, connected graphs, and generators of groups. In addition, we give a spectral interpretation of the Turan sieve.

M. Ram Murty | Yu-Ru Liu

[1] P. Turán. On a Theorem of Hardy and Ramanujan , 1934 .

[2] Franz Mertens,et al. Ein Beitrag zur analytischen Zahlentheorie. , 1874 .

[3] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.

[4] Kazuya Kato,et al. Number Theory 1 , 1999 .

[5] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .

[6] P. Cameron. Combinatorics: Topics, Techniques, Algorithms , 1995 .

[7] FILIP SAIDAK. The normal number of prime factors of f a ( n ) FILIP SAIDAK , 2005 .

[8] T. Chow. The Combinatorics behind Number-Theoretic Sieves☆ , 1998 .

[9] M. Murty,et al. On the Rédei zeta function , 1980 .

[10] E. Netto. Substitutionentheorie und ihre Anwendungen auf die Algebra , 1882 .

[11] James G. Oxley,et al. Matroid theory , 1992 .

[12] J. Dixon. Probabilistic Group Theory , 2004 .

[13] L. Lovász. Combinatorial problems and exercises , 1979 .

[14] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[15] B. M. Fulk. MATH , 1992 .

[16] Brendan D. McKay,et al. Asymptotic enumeration of Latin rectangles , 1984 .

[17] Béla Bollobás,et al. Random Graphs , 1985 .