A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
Cairns, Grant · Mendan, Stacey · Nikolayevsky, Yuri
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.