Locally bipartite graphs (Q1813153)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Locally bipartite graphs |
scientific article; zbMATH DE number 2706 |
Statements
Locally bipartite graphs (English)
0 references
25 June 1992
0 references
The solution of the following problem is given: How many edges \(\mu(n; K_{p,p+q})\) can an \(n\)-vertex graph have if each of its \((2p+q)\)-vertex subgraphs is embeddable in the complete bipartite graph \(K_{p,p+q}\)?
0 references
0.7489553689956665
0 references
0.7463768720626831
0 references
0.746300220489502
0 references
0.7434144616127014
0 references
