Concatenating bipartite graphs
Let x,y∈(0,1], and let A, B, C be disjoint nonempty stable subsets of a graph G, where every vertex in A has at least x|B| neighbours in B, and every vertex in B has at least y|C| neighbours in C, and there are no edges between A, C. We denote by φ(x,y) the maximum z such that, in all such graphs G,...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Electronic Journal of Combinatorics
2022
|