A. F. Sidorenko

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

1993

6 A. F. Sidorenko: The Ramsey Number of an N-Edge Graph versus Triangle Is at Most 2N + 1. J. Comb. Theory, Ser. B 58(2): 185-196 (1993)

1991

5 Guy Fayolle, V. A. Malyshev, M. V. Menshikov, A. F. Sidorenko: Probabilistic methods for Jackson networks. Performance of Distributed Systems and Integrated Communication Networks 1991: 209-223

4 A. F. Sidorenko: Triangle-free regular graphs. Discrete Mathematics 91(2): 215-217 (1991)

3 A. F. Sidorenko: Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices. Random Struct. Algorithms 2(1): 73-100 (1991)

1989

2 A. F. Sidorenko: Asymptotic solution for a new class of forbidden r-graphs. Combinatorica 9(2): 207-215 (1989)

1988

1 A. F. Sidorenko: An infinite permutation without arithmetic progressions. Discrete Mathematics 69(2): 211 (1988)

	1993
6		A. F. Sidorenko: The Ramsey Number of an N-Edge Graph versus Triangle Is at Most 2N + 1. J. Comb. Theory, Ser. B 58(2): 185-196 (1993)
	1991
5		Guy Fayolle, V. A. Malyshev, M. V. Menshikov, A. F. Sidorenko: Probabilistic methods for Jackson networks. Performance of Distributed Systems and Integrated Communication Networks 1991: 209-223
4		A. F. Sidorenko: Triangle-free regular graphs. Discrete Mathematics 91(2): 215-217 (1991)
3		A. F. Sidorenko: Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices. Random Struct. Algorithms 2(1): 73-100 (1991)
	1989
2		A. F. Sidorenko: Asymptotic solution for a new class of forbidden r-graphs. Combinatorica 9(2): 207-215 (1989)
	1988
1		A. F. Sidorenko: An infinite permutation without arithmetic progressions. Discrete Mathematics 69(2): 211 (1988)

Coauthor Index