Skip to main content
Article thumbnail
Location of Repository

A note on the number of edges guaranteeing a C_4 in Eulerian bipartite digraphs

By Raphael Yuster Jian Shen

Abstract

Let G be an Eulerian bipartite digraph with vertex partition sizes m; n. We prove the following Turán-type result: If e(G) > 2mn/3 then G contains a directed cycle of length at most 4. The result is sharp. We also show that if e(G) = 2mn/3 and no directed cycle of length at most 4 exists, then G must be biregular. We apply this result in order to obtain an improved upper bound for the diameter of interchange graphs

Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.7654
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://research.haifa.ac.il/~r... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.