skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree
Award ID(s):
2246292 2001130 2153938
PAR ID:
10394430
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
SIAM Journal on Discrete Mathematics
Volume:
36
Issue:
3
ISSN:
0895-4801
Page Range / eLocation ID:
2258 to 2270
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We show that solutions to the Kashiwara–Vergne problem can be extended degree by degree. This can be used to simplify the computation of a class of Drinfel’d associators, which under the Alekseev–Torossian conjecture, may comprise all associators. We also give a proof that the associated graded Lie algebra of the Kashiwara–Vergne group is isomorphic to the graded Kashiwara–Vergne Lie algebra. 
    more » « less
  2. more » « less
  3. null (Ed.)
    The Macaulay2 [5] package AlgebraicOptimization implements methods for determining the algebraic degree of an optimization problem. We describe the structure of an algebraic optimization problem and explain how the methods in this package may be used to determine the respective degrees. Special features include determining Euclidean distance degrees and maximum likelihood degrees. To our knowledge, this is the first comprehensive software package combining different methods in algebraic optimization. The package is available at https://github.com/Macaulay2/Workshop-2020-Cleveland/tree/ISSAC-AlgOpt/alg-stat/AlgebraicOptimization. 
    more » « less
  4. null (Ed.)