Results 51 to 60 of about 934 (196)
Forbidden intersection problems for families of linear maps
Discrete Analysis, 2023 Forbidden intersection problems for families of linear maps, Discrete Analysis 2023:19, 32 pp. A central problem in extremal combinatorics is to determine the maximal size of a set system given constraints on the sizes of the sets in the system and on ...
David Ellis, Guy Kindler, Noam Lifshitz
doaj +1 more source
The power of many: when genetics met yeasts and high‐throughput
Biological Reviews, EarlyView.ABSTRACT In recent years, complex technological capabilities have evolved, driven by the need to solve complex and integrative biological questions through global analyses. New equipment allows the scaling up and automation of processes which previously were carried out on a very limited scale.
Víctor A. Tallada, Víctor Carranco
wiley +1 more source
Further results on permanents of Laplacian matrices of trees
Open MathematicsThe research on the permanents of graph matrices is one of the contemporary research topic in algebraic combinatorics. Brualdi and Goldwasser characterized the upper and lower bounds of permanents of Laplacian matrices of trees.
Wu Tingzeng, Dong Xiangshuai
doaj +1 more source
Discrete Analysis, 2020 An efficient container lemma, Discrete Analysis 2020:17, 56 pp. The hypergraph container lemma, discovered independently in 2012 by David Saxton and Andrew Thomason, and by József Balogh, Robert Morris and Wojciech Samotij, is an extremely powerful tool
Jozsef Balogh, Wojciech Samotij
doaj +1 more source
Gowers norms for automatic sequences
Discrete Analysis, 2023 Gowers norms for automatic sequences, Discrete Analysis 2023:4, 62 pp. There are several situations in additive and extremal combinatorics where it is useful to decompose an object $X$ into a "structured" part $S(X)$ and a "quasirandom" part $Q(X)$.
Jakub Byszewski +2 more
doaj +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT Little is known about consumer preferences for combinations of circular business model patterns, despite their potential to benefit the design of product services. This study examines consumer preferences for product‐as‐a‐service offers, combined with circular product attributes, across Sweden and the Netherlands.
Steven Sarasini +5 more
wiley +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, EarlyView.ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source
On the number of pentagons in triangle-free graphs [PDF]
, 2013 Using the formalism of flag algebras, we prove that every triangle-free graph G with n vertices contains at most (n/5)(5) cycles of length five. Moreover, the equality is attained only when n is divisible by five and G is the balanced blow-up of the ...
Hatami, Hamed +4 more
core +1 more source
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
Forum of Mathematics, SigmaAn ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders.
Michael Anastos +3 more
doaj +1 more source
Simple juntas for shifted families
Discrete Analysis, 2020 **For the moment the link is to the submitted version of the article. It will be updated when the final version has been posted to arXiv.** Simple juntas for shifted families, Discrete Analysis 2020:14, 18 pp.
Peter Frankl, Andrey Kupavskii
doaj +1 more source