Results 91 to 100 of about 997,897 (240)
On minimal presentations of numerical monoids
Bulletin of the London Mathematical Society, Volume 57, Issue 3, Page 878-894, March 2025.Abstract We consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing this problem, we apply tools from Hilbert functions and free resolutions of artinian standard graded ...
Alessio Moscariello, Alessio Sammartano
wiley +1 more source
Short proofs of some extremal results [PDF]
arXiv, 2012 We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the relevant proofs are quite short.
arxiv
On Meyniel extremal families of graphs [PDF]
arXiv, 2022 We provide new constructions of Meyniel extremal graphs, which are families of graphs with the conjectured largest asymptotic cop number. Using spanning subgraphs, we prove that there are an exponential number of new Meyniel extremal families with specified degrees.
arxiv
Journal of the London Mathematical Society, Volume 111, Issue 3, March 2025.Abstract We provide partial solutions to two problems posed by Shehtman concerning the modal logic of the Čech–Stone compactification of an ordinal space. We use the Continuum Hypothesis to give a finite axiomatization of the modal logic of β(ω2)$\beta (\omega ^2)$, thus resolving Shehtman's first problem for n=2$n=2$. We also characterize modal logics
Guram Bezhanishvili +3 more
wiley +1 more source
Kneser graphs are like Swiss cheese
Discrete Analysis, 2018 Kneser graphs are like Swiss cheese, Discrete Analysis 2018:2, 18 pp. This paper relates two very interesting areas of research in extremal combinatorics: removal lemmas, and influence of variables.
Ehud Friedgut, Oded Regev
doaj +1 more source
On the nonexistence of ternary extremal self-dual codes [PDF]
arXiv, 2008 In this note, we give a new nonexistence result of ternary extremal self-dual codes.
arxiv
Size‐Ramsey numbers of graphs with maximum degree three
Journal of the London Mathematical Society, Volume 111, Issue 3, March 2025.Abstract The size‐Ramsey number r̂(H)$\hat{r}(H)$ of a graph H$H$ is the smallest number of edges a (host) graph G$G$ can have, such that for any red/blue colouring of G$G$, there is a monochromatic copy of H$H$ in G$G$. Recently, Conlon, Nenadov and Trujić showed that if H$H$ is a graph on n$n$ vertices and maximum degree three, then r̂(H)=O(n8/5 ...
Nemanja Draganić, Kalina Petrova
wiley +1 more source
Extremal Infinite Graph Theory [PDF]
arXiv, 2011 We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.
arxiv
ChemCatChem, Volume 17, Issue 4, February 17, 2025.In this study, we find that relative to pure Ir and pure Rh, an Ir50Rh50 alloy shows a lowered N2 limiting potential, suggesting improved activity toward the ammonia oxidation reaction. Of the structures we investigated, this alloy is the most favored considering both enthalpy and entropy.
Brendan J. R. Laframboise +2 more
wiley +1 more source
Cacti with Extremal PI Index [PDF]
, 2016 The vertex PI index $PI(G) = \sum_{xy \in E(G)} [n_{xy}(x) + n_{xy}(y)]$ is a distance-based molecular structure descriptor, where $n_{xy}(x)$ denotes the number of vertices which are closer to the vertex $x$ than to the vertex $y$ and which has been the
Wang, Chunxiang +2 more
core +1 more source