Definition
Let Ka,b denote a complete bipartite graph with a vertices on one side of the bipartition and b vertices on the other side. Define Za,b(m,n) to be the smallest integer k such that every bipartite graph that has m vertices on one side of its bipartition, n vertices on the other side, and k edges contains a subgraph isomorphic to Ka,b.
An alternative and equivalent definition is that Za,b(m,n) is the smallest integer k such that every (0,1)-matrix of size m × n with k 1's must have a set of a rows and b columns such that the corresponding a×b submatrix is made up only of 1's.
For the specific case when m = n and a = b the shorter notation Za(n) = Za,b(m,n) may also be used.
Read more about this topic: Zarankiewicz Problem
Famous quotes containing the word definition:
“I’m beginning to think that the proper definition of “Man” is “an animal that writes letters.””
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)
“No man, not even a doctor, ever gives any other definition of what a nurse should be than this—”devoted and obedient.” This definition would do just as well for a porter. It might even do for a horse. It would not do for a policeman.”
—Florence Nightingale (1820–1910)
“Although there is no universal agreement as to a definition of life, its biological manifestations are generally considered to be organization, metabolism, growth, irritability, adaptation, and reproduction.”
—The Columbia Encyclopedia, Fifth Edition, the first sentence of the article on “life” (based on wording in the First Edition, 1935)