| A new series of dense graphs of high girth F Lazebnik, VA Ustimenko, AJ Woldar Bulletin of the American mathematical society 32 (1), 73-79, 1995 | 335 | 1995 |
| Explicit construction of graphs with an arbitrary large girth and of large size F Lazebnik, VA Ustimenko Discrete Applied Mathematics 60 (1-3), 275-284, 1995 | 214 | 1995 |
| On hypergraphs of girth five F Lazebnik, J Verstraëte the electronic journal of combinatorics 10 (1), R25, 2003 | 95 | 2003 |
| New examples of graphs without small cycles and of large size F Lazebnik, VA Ustimenko European Journal of Combinatorics 14 (5), 445-460, 1993 | 85 | 1993 |
| Polarities and 2k-cycle-free graphs F Lazebnik, VA Ustimenko, AJ Woldar Discrete Mathematics 197, 503-513, 1999 | 83 | 1999 |
| A characterization of the components of the graphs D (k, q) F Lazebnik, VA Ustimenko, AJ Woldar Discrete Mathematics 157 (1-3), 271-283, 1996 | 83 | 1996 |
| Upper bounds on the order of cages F Lazebnik, VA Ustimenko, AJ Woldar the electronic journal of combinatorics, R13-R13, 1997 | 79 | 1997 |
| Extremal graphs without three‐cycles or four‐cycles DK Garnick, YHH Kwong, F Lazebnik Journal of Graph Theory 17 (5), 633-645, 1993 | 79 | 1993 |
| On systems of linear diophantine equations F Lazebnik Mathematics Magazine 69 (4), 261-266, 1996 | 67 | 1996 |
| General properties of some families of graphs defined by systems of equations F Lazebnik, AJ Woldar Journal of Graph Theory 38 (2), 65-86, 2001 | 64 | 2001 |
| Graphs of prescribed girth and bi-degree Z Furedi, F Lazebnik, A Seress, VA Ustimenko, AJ Woldar Journal of Combinatorial Theory, Series B 64 (2), 228-239, 1995 | 63 | 1995 |
| An infinite series of regular edge‐but not vertex‐transitive graphs F Lazebnik, R Viglione Journal of Graph Theory 41 (4), 249-258, 2002 | 55 | 2002 |
| Irregularity strength of dense graphs B Cuckler, F Lazebnik Journal of Graph Theory 58 (4), 299-313, 2008 | 46 | 2008 |
| Some Algebraic Constructions of Dense Graphs of Large Girth and of Large Size. F Lazebnik, VA Ustimenko Expanding Graphs 10, 75-93, 1992 | 44 | 1992 |
| Methods for Euclidean geometry O Byer, F Lazebnik, DL Smeltzer American Mathematical Soc., 2010 | 42 | 2010 |
| On the spectrum of Wenger graphs SM Cioabă, F Lazebnik, W Li Journal of Combinatorial Theory, Series B 107, 132-139, 2014 | 37 | 2014 |
| Properties of certain families of 2k-cycle-free graphs F Lazebnik, VA Ustimenko, AJ Woldar Journal of Combinatorial Theory, Series B 60 (2), 293-298, 1994 | 36 | 1994 |
| On monomial graphs of girth eight V Dmytrenko, F Lazebnik, J Williford Finite Fields and Their Applications 13 (4), 828-842, 2007 | 31 | 2007 |
| New constructions of bipartite graphs on m, n vertices with many edges and without small cycles F Lazebnik, VA Ustimenko, AJ Woldar Journal of Combinatorial Theory, Series B 61 (1), 111-117, 1994 | 31 | 1994 |
| On the greatest number of 2 and 3 colorings of a (v, e)‐graph F Lazebnik Journal of graph theory 13 (2), 203-214, 1989 | 31 | 1989 |
