Research Contributions
Zarankiewicz wrote works on cut-points in connected spaces, on conformal mappings, on complex functions and number theory, and triangular numbers.
The Zarankiewicz problem is named after Zarankiewicz. This problem asks, for a given size of (0,1)-matrix, how many matrix entries must be set equal to 1 in order to guarantee that the matrix contains at least one a × b submatrix is made up only of 1's. An equivalent formulation in extremal graph theory asks for the maximum number of edges in a bipartite graph with no complete bipartite subgraph Ka,b.
The Zarankiewicz crossing number conjecture in the mathematical field of graph theory is also named after Zarankiewicz. The conjecture states that the crossing number of a complete bipartite graph equals
Zarankiewicz proved that this formula is an upper bound for the actual crossing number. The problem of determining the number was suggested by Paul Turán and became known as Turán's brick factory problem.
Read more about this topic: Kazimierz Zarankiewicz
Famous quotes containing the word research:
“Men talk, but rarely about anything personal. Recent research on friendship ... has shown that male relationships are based on shared activities: men tend to do things together rather than simply be together.... Female friendships, particularly close friendships, are usually based on self-disclosure, or on talking about intimate aspects of their lives.”
—Bettina Arndt (20th century)