A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
classification
🧮 math.CO
keywords
alonben-shimonbipartiteconditiongraphkrivelevichrefinementresult
read the original abstract
We give a sharp refinement of a result of Alon, Ben-Shimon and Krivelevich. This gives a sufficient condition for a finite sequence of positive integers to be the vertex degree list of both parts of a bipartite graph. The condition depends only on the length of the sequence and its largest and smallest elements.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.