On restricted edge-colorings of bicliques

Authors:
Dhruv Mubayi;Douglas B. West
Affiliations:
School of Mathematics, Georgia Institute of Technology, Atlanta, GA;Department of Mathematics, University Of Illinois, at Urbana-Champai, 1409 West Green Street, Urbana, IL
Venue:
Discrete Mathematics - Kleitman and combinatorics: a celebration
Year:
2002

Citing 4
Cited 0

Extremal graphs with no C4,s, or C10,s

Journal of Combinatorial Theory Series B
New asymptotics for bipartite Tura´n numbers

Journal of Combinatorial Theory Series A
Norm-graphs: variations and applications

Journal of Combinatorial Theory Series B
On generalized Ramsey theory: The bipartite case

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the minimum and maximum number of colors in edge-colorings of Kn,n, such that every copy of Kp,p receives at least q and at most q' colors. Along the way we improve the bounds on some bipartite Turán numbers.