Concatenating bipartite graphs
From MaRDI portal
Publication:2144334
Abstract: Let and let be disjoint nonempty subsets of a graph , where every vertex in has at least neighbours in , and every vertex in has at least neighbours in . We denote by the maximum such that, in all such graphs , there is a vertex in that is joined to at least vertices in by two-edge paths. The function is interesting, and we investigate some of its properties. For instance, we show that it is symmetric in and , and that it has a discontinuity at for all integers . We raise a number of questions and conjectures.
Recommendations
Cites work
This page was built for publication: Concatenating bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144334)