Mathematics, Volume 12, Issue 22
2024 November-2 - 187 articles
Cover Story: The article derives novel degree sequence-based bounds on matching numbers, valid for any simple graph. The figure shows an application in number theory: the first 200 prime gaps are represented as node degrees in a simple graph and are generated via the degree-preserving growth (DPG) mechanism. The DPG builds an ever-growing graph sequence by joining a newly incoming node of a given degree (the next prime gap value) to the nodes of a randomly selected matching of proper size, then discarding the edges of the matching. The incoming nodes’ degrees constrain the size of the matching that can be selected, which, in turn, constrains the sizes of the future incoming degrees. It has previously been proven, however, that, for the prime gap sequence, this process can be continued indefinitely, if the Riemann hypothesis holds. View this paper - Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
- You may sign up for email alerts to receive table of contents of newly released issues.
- PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.