Results 51 to 60 of about 995,571 (241)
Pairwise Intersections and Forbidden Configurations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let $f_m(a,b,c,d)$ denote the maximum size of a family $\mathcal{F}$ of subsets of an $m$-element set for which there is no pair of subsets $A,B \in \mathcal{F}$ with $|A \cap B| \geq a$, $|\bar{A} \cap B| \geq b$, $|A \cap \bar{B}| \geq c$, and $|\bar{A}
Richard P. Anstee, Peter Keevash
doaj +1 more source
Extremals of the supereigenvector cone in max algebra: a combinatorial description [PDF]
Linear Algebra and its Applicaitions 479 (2015) 106-117, 2014 We give a combinatorial description of extremal generators of the supereigenvector cone {x: Ax>=x} in max algebra.
arxiv +1 more source
A question of Bukh on sums of dilates
Discrete Analysis, 2021 A question of Bukh on sums of dilates, Discrete Analysis 2021:13, 21 pp. Let $A$ and $B$ be subsets of an Abelian group. Their sumset $A+B$ is defined to be the set of all $a+b$ such that $a\in A$ and $b\in B$.
Brandon Hanson, Giorgis Petridis
doaj +1 more source
BPS counting for knots and combinatorics on words [PDF]
, 2016 We discuss relations between quantum BPS invariants defined in terms of a product decomposition of certain series, and difference equations (quantum A-polynomials) that annihilate such series.
Kucharski, Piotr, Sułkowski, Piotr
core +2 more sources
, 2006 This is the report on the Oberwolfach workshop on Combinatorics, held 1–7 January 2006. Combinatorics is a branch of mathematics studying families of mainly, but not exclusively, finite or countable structures – discrete objects.
core +2 more sources
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
, 2011 Combinatorics is a fundamental mathematical discipline which focuses on the study of discrete objects and their properties. The current workshop brought together researchers from diverse fields such as Extremal and Probabilistic Combinatorics, Discrete ...
core +2 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
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
Lecture notes on algebraic methods in combinatorics [PDF]
arXiv, 2023 These are lecture notes of a course taken in Leipzig 2023, spring semester. It deals with extremal combinatorics, algebraic methods and combinatorial geometry. These are not meant to be exhaustive, and do not contain many proofs that were presented in the course.
arxiv