Bernoulli trials of fixed parity, random and randomly oriented graphs

Wassily Hoeffding, On the Distribution of the Number of Successes in Independent Trials

1956

Earlier work this paper cites.

László Lovász, Combinatorial Problems and Excercises

1979

Earlier work this paper cites.

Rob Kaas and Jan M. Buhrman, Mean, Median and Mode in Binomial Distributions

1980

Earlier work this paper cites.

Colin McDiarmir, General percolation and random graphs

1981

Earlier work this paper cites.

Yusef Alavi, Paul Erdős, Paresh J. Malde and Allen J. Schwenk, The vertex independence sequence of a graph is not constrained

1987

Earlier work this paper cites.

Shinsei Tazama, Teruhiro Shirakura and Saburo Tamura, Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree

1991

Cited alongside, same era.

Yaohong H. Wang: On the number of successes in independent trials

Original

1993

Cited alongside, same era.

Kais Hamza, The smallest uniform upper bound on the distance between the mean and the median of the Binomial and Poisson distributions

1995

Cited alongside, same era.

Béla Bollobás, Random Graphs

2001

Cited alongside, same era.

András Frank, Tibor Jordán, Zoltán Szigeti, An orientation theorem with parity conditions

2001

Cited alongside, same era.

Moshe Shaked and George J. Shanthikumar, Stochastic Orders and their Applications

2007

Later among the works it cites.

Svante Linusson, A note on correlations in randomly oriented graphs

Original

2009

Later among the works it cites.

Sven Erik Alm and Svante Linusson, A counter-intuitive correlation in a random tournament

2011

Later among the works it cites.

Erik Broman, Tim van de Brug, Wouter Kager and Ronald Meester, Stochastic domination and weak convergence of conditioned Bernoulli random variables

2012

Later among the works it cites.

Christos Pelekis and Moritz Schauer, Network coloring and colored coin games

2013

Closest in time.