An Improvement of the Lower Bound on the Minimum Number of ≤<i>k</i>-Edges
In this paper, we improve the lower bound on the minimum number of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo> </mo><mo>≤</mo><mi>k</mi></mrow></semant...
Main Authors: | Javier Rodrigo, Susana Merchán, Danilo Magistrali, Mariló López |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/5/525 |
Similar Items
-
A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
by: Colton Magnant
Published: (2018-01-01) -
On the Independence Number of Edge Chromatic Critical Graphs
by: Pang Shiyou, et al.
Published: (2014-08-01) -
Total resolving number of edge cycle graphs
by: J. Paulraj Joseph, et al.
Published: (2020-09-01) -
An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane
by: Aurora Espinoza-Valdez, et al.
Published: (2021-06-01) -
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
by: P. Anusha Devi, et al.
Published: (2015-10-01)