Graphs of Prescribed Girth and Bi-Degree

Z. Füredi, F. Lazebnik, A. Seress, V. A. Ustimenko, A. J. Woldar

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

We say that a bipartite graph Г(V1 ∪ V2, E) has bi-degree r, s if every vertex from V1 has degree r and every vertex from V2 has degree s. Г is called an (r, s, t)-graph if, additionally, the girth of Г is 2t. For t > 3, very few examples of (r, s, t)-graphs were previously known. In this paper we give a recursive construction of (r, s, t)-graphs for all r, s, t ≥ 2, as well as an algebraic construction of such graphs for all r, s ≥ t ≥ 3.

Original languageEnglish
Pages (from-to)228-239
Number of pages12
JournalJournal of Combinatorial Theory, Series B
Volume64
Issue number2
DOIs
Publication statusPublished - Jul 1995

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Graphs of Prescribed Girth and Bi-Degree'. Together they form a unique fingerprint.

  • Cite this

    Füredi, Z., Lazebnik, F., Seress, A., Ustimenko, V. A., & Woldar, A. J. (1995). Graphs of Prescribed Girth and Bi-Degree. Journal of Combinatorial Theory, Series B, 64(2), 228-239. https://doi.org/10.1006/jctb.1995.1033