4 papers
Efficient Enumeration of Cliques in Graphs with Bounded Maximum Degree
Shi-Cai Gong, Jia-Jin Wang, Xin-Hao Zhu +1
In recent years, there has been a surge of interest in extremal problems concerning the enumeration of independent sets or cliques in graphs with specific constraints. For instance…
On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
Wenjun Yu, Bo-Jun Yuan, Moshe Schwartz
We study generalized fractional repetition codes that have zero skip cost, and which are based on covering designs. We show that a zero skip cost is always attainable, perhaps at a…
The number of dissociation sets in connected graphs
Bo-Jun Yuan, Ni Yang, Hong-Yan Ge +1
Extremal problems related to the enumeration of graph substructures, such as independent sets, matchings, and induced matchings, have become a prominent area of research with the a…
Maximal and maximum induced matchings in connected graphs
Bo-Jun Yuan, Zhao-Yu Yang, Lu Zheng +1
An induced matching in a graph is a set of edges whose endpoints induce a -regular subgraph. Gupta et al. (2012,\cite{Gupta}) showed that every -vertex graph has at most $10^…