Nearly Complete Graphs Decomposable into Large Induced Matchings and\n their Applications

v1

Type:Preprint

0 views

[![NobleID](https://www.nobleid.org/api/badge/CD3F3936.svg?ark=w1%2F20260515%2FCD3F3936)](https://nobleid.org/work/w1/20260515/CD3F3936)

ARK Inflections

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors