Results 131 to 140 of about 37,501 (244)
Discrete Mathematics, 2002 This nice survey paper gives a short introduction into Daniel Kleitman's seminal contributions to combinatorics, with special emphasis on extremal hypergraph theory, asymptotic enumerations, and discrete geometry.
openaire +2 more sources
How to pick your football team
Mathematika, Volume 72, Issue 4, October 2026.Abstract Team captains Alice and Bob divide up 2m$2m$ footballers, each reduced to a real‐valued score, into two teams of m$m$ footballers each. On each turn, one captain plays picker, and the other chooser: the picker names a footballer yet to be selected, and the chooser decides which captain's team receives that footballer.
Bhargav Narayanan
wiley +1 more source
An effective Bombieri–Vinogradov error term for sifting problems
Mathematika, Volume 72, Issue 4, October 2026.Abstract In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that explicit values for which they hold cannot be computed.
Daniel R. Johnston
wiley +1 more source
, 2010 A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we generalize this problem
Sami H. Assaf, Assaf, Sami H.
core
Mathematika, Volume 72, Issue 4, October 2026.Abstract We say that a plane set A$A$ is graph‐null, if there is a function g:[0,1]→R$g\colon [0,1]\rightarrow {\mathbb {R}}$ such that λ2(A+graphg)=0$\lambda _2 (A+{\rm graph}\, g)=0$. A plane set A$A$ has the translational Kakeya property if, for every translated copy A′$A^{\prime }$ of A$A$ and for every ε>0$\varepsilon >0$, there is a finite ...
M. Laczkovich, A. Máthé
wiley +1 more source
Lattice Path Combinatorics and Interactions
International audienceLattice paths are a fundamental concept in combinatorics, providing a geometric perspective on many counting problems. By mapping problems onto a lattice, mathematicians can exploit symmetry, recursion, and combinatorial identities ...
Banderier, Cyril +2 more
core +1 more source
BarekengThe rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +1 more source
Wasserstein rigidity over Rn$\mathbb {R}^n$ with smooth norms
Mathematika, Volume 72, Issue 4, October 2026.Abstract We study p−Wasserstein$p-{\rm Wasserstein}$ spaces Wp(Rn,dN)$ \mathcal {W}_p(\mathbb {R}^n, d_N)$ over Rn$\mathbb {R}^n$ equipped with a norm metric dN$d_N$. We show that, if the norm is smooth enough, then the Wasserstein space is isometrically rigid whenever p≠2$p \ne 2$.
Zoltán M. Balogh +3 more
wiley +1 more source
The combinatorics of Motzkin polyominoes
Discrete Applied MathematicsA word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whenever $w_1=\texttt{1}$, $1\leq w_k\leq w_{k-1}+1$, and $w_{k-1}\neq w_{k}$ for $k=2, \dots, n$. It can be associated to a $n$-column Motzkin polyomino whose $i$-th column contains $w_i$ cells, and all columns are bottom-justified.
Baril, Jean-Luc +3 more
openaire +4 more sources
Partitioning 3-colored complete graphs into three monochromatic cycles [PDF]
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core +1 more source