On a problem of K. Zarankiewicz

T Kővári, V. T. S., & Turán, P. (1954). On a problem of K. Zarankiewicz.

Type

Unclassified

Intellectual base

Unclassified

Year

1954

DOI

10.4064/cm-3-1-50-57

Link

https://doi.org/10.4064/cm-3-1-50-57

Cited by

1 citation across 1 artifact.

Domain-specific

• Biclique-free graph
  • A graph is K_(s,t)-free when no chosen s vertices on one side and t on another have every cross-edge; a family is biclique-free when one fixed exclusion applies throughout.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:726fa2766139 · see in the full table