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

Shen, Jian, and Yuster, Raphael. "A note on the number of edges guaranteeing a in Eulerian bipartite digraphs.." The Electronic Journal of Combinatorics [electronic only] 9.1 (2002): Research paper N6, 6 p.-Research paper N6, 6 p.. <http://eudml.org/doc/122037>.

@article{Shen2002,
author = {Shen, Jian, Yuster, Raphael},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {digraph; extremal theory; cycle},
language = {eng},
number = {1},
pages = {Research paper N6, 6 p.-Research paper N6, 6 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A note on the number of edges guaranteeing a in Eulerian bipartite digraphs.},
url = {http://eudml.org/doc/122037},
volume = {9},
year = {2002},
}

TY - JOUR
AU - Shen, Jian
AU - Yuster, Raphael
TI - A note on the number of edges guaranteeing a in Eulerian bipartite digraphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2002
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 9
IS - 1
SP - Research paper N6, 6 p.
EP - Research paper N6, 6 p.
LA - eng
KW - digraph; extremal theory; cycle
UR - http://eudml.org/doc/122037
ER -