A. A. Sapozhenko
Abstract
The asymptotics of the independent set number is found for bipartite graphs which minimum degree is equal in order to the number of vertices.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The asymptotics of the independent set number is found for bipartite graphs which minimum degree is equal in order to the number of vertices.
Key concepts: Bipartite graph, Combinatorics, Mathematics, Computer science, Graph