Results 41 to 50 of about 14,970 (213)
Supersaturation and stability for forbidden subposet problems [PDF]
, 2015 We address a supersaturation problem in the context of forbidden subposets. A family $\mathcal{F}$ of sets is said to contain the poset $P$ if there is an injection $i:P \rightarrow \mathcal{F}$ such that $p \le_P q$ implies $i(p) \subset i (q)$.
Patkos, Balazs
core +5 more sources
Generalized Ramsey–Turán density for cliques
Forum of Mathematics, SigmaWe study the generalized Ramsey–Turán function $\mathrm {RT}(n,K_s,K_t,o(n))$ , which is the maximum possible number of copies of $K_s$ in an n-vertex $K_t$ -free graph with independence number $o(n)$ . The case when $s=2$
Jun Gao +3 more
doaj +1 more source
Random multilinear maps and the Erdős box problem
Discrete Analysis, 2021 Random multilinear maps and the Erdős box problem, Discrete Analysis 2021:17, 8 pp. A major theme in extremal combinatorics is determining the maximum number of edges that a graph or hypergraph can have if it does not contain a certain fixed graph or ...
David Conlon +2 more
doaj +1 more source
Some characterizations of Sturmian words in terms of the lexicographic order [PDF]
, 2012 In this paper we present three new characterizations of Sturmian words based on the lexicographic ordering of their ...
Bucci, Michelangelo +2 more
core +4 more sources
On the extremal combinatorics of the hamming space
Journal of Combinatorial Theory, Series A, 1995 AbstractWe present new asymptotic bounds for problems in extremal set theory related to finding the maximum number of qualitatively 3-independent bipartitions of an n-set. We consider the space of all binary sequences of some fixed length n. As we select subsets of growing cardinality we see an increasing number of different “small configurations ...
openaire +4 more sources
f-vectors implying vertex decomposability [PDF]
, 2012 We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.
Lasoń, Michał
core +2 more sources
A proof of the Elliott–Rödl conjecture on hypertrees in Steiner triple systems
Forum of Mathematics, SigmaHypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given $\mu>0$ , there exists $n_0$ such that the following holds.
Seonghyuk Im +3 more
doaj +1 more source
Geometric variational problems of statistical mechanics and of combinatorics
, 2000 We present the geometric solutions of the various extremal problems of statistical mechanics and combinatorics. Together with the Wulff construction, which predicts the shape of the crystals, we discuss the construction which exhibits the shape of a ...
Alexander K. +9 more
core +2 more sources
Enumeration and Construction of Row‐Column Designs
Journal of Combinatorial Designs, EarlyView.ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate.
Gerold Jäger +3 more
wiley +1 more source
Extremal words in morphic subshifts [PDF]
, 2013 Given an infinite word X over an alphabet A a letter b occurring in X, and a total order \sigma on A, we call the smallest word with respect to \sigma starting with b in the shift orbit closure of X an extremal word of X.
Currie, James D. +3 more
core +2 more sources