\(C_4\)-saturated bipartite graphs
type: Item
instance of: scholarly article
title: \(C_4\)-saturated bipartite graphs
zbMATH Open document ID: 1015.05036
DOI: 10.1016/S0012-365X(02)00371-0
published in: Discrete Mathematics
publication date: 2003-03-16T00:00:00Z
review text: The authors consider the problem of finding subgraphs of the complete bipartite graph \(K_{m,n}\) which do not contain a subgraph isomorphic to a copy of \(K_{s,t}\) and are maximal with respect to this property. They translate this problem to the terminology of partial block designs. Their main interest concerns the case of \(s=t=2\) in which they apply some simple facts from the design theory to give alternate proofs of some classic asymptotic results on the Zarankiewicz problem due to Bollobás.
reviewed by: Zbigniew Lonc
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 1882156
zbMATH Keywords: Zarankiewicz problem
zbMATH Keywords: bipartite graph
zbMATH Keywords: partial \(t\)-design
author: Darryn Bryant
author: Hung-Lin Fu
MaRDI profile type: Publication
Recommended article: Q5750884
Recommended article: Uniquely \(C _{4}\)-saturated graphs
Recommended article: \(P_4\)-colorings and \(P_4\)-bipartite graphs
Recommended article: \(K_{s,t}\)-saturated bipartite graphs
Recommended article: Q4846549
Recommended article: \(C_{4p}\)-frame of complete multipartite multigraphs
Recommended article: On bipartite graphs having minimum fourth adjacency coefficient
Recommended article: Q3089293
Recommended article: The edge spectrum of \(K_4\)-saturated graphs
Recommended article: Q3365464
description: scientific article; zbMATH DE number 1882156