Results 161 to 170 of about 235,748 (327)
A Note on the Frankl Conjecture [PDF]
arXiv, 2019 The Frankl conjecture (called also union-closed sets conjecture) is one of the famous unsolved conjectures in combinatorics of finite sets. In this short note, we introduce and to some extent justify some variants of the Frankl conjecture.
arxiv
On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph
Journal of Graph Theory, Volume 108, Issue 4, Page 817-818, April 2025.ABSTRACT Answering a question of Erdős and Nešetřil, we show that the maximum number of inclusion‐wise minimal vertex cuts in a graph on n $n$ vertices is at most 1.889 9 n $1.889{9}^{n}$ for large enough n $n$.
Domagoj Bradač
wiley +1 more source
Software for enumerative and analytic combinatorics [PDF]
arXiv, 2016 We survey some general-purpose symbolic software packages that implement algorithms from enumerative and analytic combinatorics. Software for the following areas is covered: basic combinatorial objects, symbolic combinatorics, P\'olya theory, combinatorial species, and asymptotics. We describe the capabilities that the packages offer as well as some of
arxiv
A Simple Explanation for Harmonic Word Order
Cognitive Science, Volume 49, Issue 4, April 2025.Abstract Harmonic word order is a well‐established tendency in natural languages, which has previously been explained as a single ordering rule for all head‐dependent relations. We propose that it can be more parsimoniously explained as an outcome of word‐class frequencies, where the purported “head” is the most frequently instantiated word class in a ...
John Mansfield, Lothar Sebastian Krapp
wiley +1 more source
Book Review: Infinitary combinatorics and the axiom of determinateness [PDF]
, 1979 John R. Steel
openalex +1 more source
Relative cubulation of relative strict hyperbolization
Journal of the London Mathematical Society, Volume 111, Issue 4, April 2025.Abstract We prove that many relatively hyperbolic groups obtained by relative strict hyperbolization admit a cocompact action on a CAT(0)$\operatorname{CAT}(0)$ cubical complex. Under suitable assumptions on the peripheral subgroups, these groups are residually finite and even virtually special.
Jean‐François Lafont, Lorenzo Ruffoni
wiley +1 more source
T. P. McDonough and V. C. Mavron (editors), Combinatorics (London Mathematical Society Lecture Note Series No. 13, Cambridge University Press, 1974), v + 204 pp., £3·20. [PDF]
, 1977 Donald Monk
openalex +1 more source
A central limit theorem for the matching number of a sparse random graph
Journal of the London Mathematical Society, Volume 111, Issue 4, April 2025.Abstract In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erdős–Rényi random graph, in an influential paper pioneering the so‐called differential equation method for analysis of random graph processes. Strengthening this classical result, and answering a question of Aronson, Frieze and Pittel, we prove a ...
Margalit Glasgow +3 more
wiley +1 more source