A new hill-climbing algorithm improves the best known lower bounds on ex(n;{C3,C4}) for all n in {74,...,198} except n = 96,97.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Improved lower bounds on the maximum size of graphs with girth 5
A new hill-climbing algorithm improves the best known lower bounds on ex(n;{C3,C4}) for all n in {74,...,198} except n = 96,97.