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

Jian Shen; Raphael Yuster

doi:10.37236/1667

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

Jian Shen, Raphael Yuster

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	1-6
Number of pages	6
Journal	Electronic Journal of Combinatorics
Volume	9
Issue number	1 N
DOIs	https://doi.org/10.37236/1667
State	Published - 2002

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.37236/1667

Cite this

@article{42a85a3a541e40cc9eb3df2e959d9719,

title = "A note on the number of edges guaranteeing a C4 in Eulerian bipartite digraphs",

abstract = "Let G be an Eulerian bipartite digraph with vertex partition sizes m, n. We prove the following Tur{\'a}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.",

author = "Jian Shen and Raphael Yuster",

year = "2002",

doi = "10.37236/1667",

language = "English",

volume = "9",

pages = "1--6",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "1 N",

}

TY - JOUR

T1 - A note on the number of edges guaranteeing a C4 in Eulerian bipartite digraphs

AU - Shen, Jian

AU - Yuster, Raphael

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=4043154064&partnerID=8YFLogxK

U2 - 10.37236/1667

DO - 10.37236/1667

M3 - Article

AN - SCOPUS:4043154064

SN - 1077-8926

VL - 9

SP - 1

EP - 6

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1 N

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this