1. H. Bruhn and O. Schaudt, The union-closed sets conjecture almost holds for almost all random bipartite graphs, CoRR, arXiv:1302.7141 [math.CO], 2013.
2. M. Chudnovsky and P. D. Seymour, Claw-free graphs. III. Circular interval graphs, J. Combin. Theory (Series B) 98(4) (2008), 812–834.
3. D. Duffus, P. Frankl and V. Rödl, Maximal independent sets in bipartite graphs obtained from boolean lattices, Eur. J. Comb. 32(1) (2011), 1–9.
4. P. Frankl, Handbook of combinatorics (vol. 2), MIT Press, Cambridge, MA, USA, 1995, 1293–1329.
5. P. L. Hammer, F. Maffray and M. Preissmann, “A Characterization of Chordal Bipartite Graphs”, Rutcor research report, Rutgers University, New Brunswick, NJ, 1989.