English
Related papers

Related papers: The 1/3-2/3 conjecture for $N$-free ordered sets

200 papers

We prove a vertex domination conjecture of Erd\H os, Faudree, Gould, Gy\'arf\'as, Rousseau, and Schelp, that for every n-vertex complete graph with edges coloured using three colours there exists a set of at most three vertices which have…

Combinatorics · Mathematics 2014-02-28 Rahil Baber , John Talbot

Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…

Combinatorics · Mathematics 2014-12-04 Samuel Fiorini , Selim Rexhep

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

A set in $\mathbb R^d$ is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and L\'angi claiming that an almost-equidistant set…

Metric Geometry · Mathematics 2019-04-18 Alexandr Polyanskii

We consider words over a binary alphabet. A word $w$ is overlap-free if it does not have factors (blocks of consecutive letters) of the form $uvuvu$ for nonempty $u$. Let $M(w)$ denote the number of positions that are middle positions of…

Combinatorics · Mathematics 2021-08-11 Tero Harju

L\'evai and Pyber proposed the following as a conjecture: Let $G$ be a profinite group such that the set of solutions of the equation $x^n=1$ has positive Haar measure. Then $G$ has an open subgroup $H$ and an element $t$ such that all…

Group Theory · Mathematics 2020-01-22 Meisam Soleimani Malekan , Alireza Abdollahi , Mahdi Ebrahimi

We give a necessary and sufficient condition for the fundamental group of a finite graph of groups with infinite cyclic edge groups to be acylindrically hyperbolic, from which it follows that a finitely generated group splitting over Z…

Group Theory · Mathematics 2015-09-21 J. O. Button

Let A,B be matrices in SL(2,R) having trace greater than or equal to 2. Assume the pair A,B is coherently oriented, that is, can be conjugated to a pair having nonnegative entries. Assume also that either A,B^(-1) is coherently oriented as…

Dynamical Systems · Mathematics 2021-08-11 Giovanni Panti , Davide Sclosa

A {\em cross-free} set of size $m$ in a Steiner triple system $(V,{\cal{B}})$ is three pairwise disjoint $m$-element subsets $X_1,X_2,X_3\subset V$ such that no $B\in {\cal{B}}$ intersects all the three $X_i$-s. We conjecture that for every…

Combinatorics · Mathematics 2015-09-21 Andras Gyarfas

In this paper, we study the well extension of strict(irreflective) partial well orderings. We first prove that any partially well-ordered structure <A, R> can be extended to a well-ordered one. Then we prove that every linear extension of…

Logic in Computer Science · Computer Science 2015-07-28 Haoxiang Lin

We prove that the conjecture made by Peter Frankl in the late 1970s is true. In other words for every finite union-closed family which contains a non?empty set, there is an element that belongs to at least half of its m

Combinatorics · Mathematics 2024-05-08 Roberto Demontis

A family of sets is called union-closed if whenever $A$ and $B$ are sets of the family, so is $A\cup B$. The long-standing union-closed conjecture states that if a family of subsets of $[n]$ is union-closed, some element appears in at least…

Combinatorics · Mathematics 2019-02-20 Tom Eccles

A language over an alphabet $B = A \cup \overline{A}$ of opening ($A$) and closing ($\overline{A}$) brackets, is balanced if it is a subset of the Dyck language $D_B$ over $B$, and it is well-formed if all words are prefixes of words in…

Formal Languages and Automata Theory · Computer Science 2020-03-16 Raphaela Löbel , Michael Luttenberger , Helmut Seidl

We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…

Combinatorics · Mathematics 2018-04-19 Maurice Pouzet , Imed Zaguia

F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…

Combinatorics · Mathematics 2020-11-17 George M. Bergman

We prove that every interval order $P$ with no infinite antichain has a Gallai decomposition. That is, $P$ is a lexicographical sum of proper interval orders over a chain, an antichain or a prime interval order. This is a consequence of the…

Combinatorics · Mathematics 2024-11-12 Maurice Pouzet , Imed Zaguia

A new class of partial order-types, class $\gbqo^+$ is defined and investigated here. A poset $P$ is in the class $W^+ $ iff the free poset algebra $F(P)$ is generated by a better quasi-order $G$ that is included in the free lattice $L(P)$.…

General Topology · Mathematics 2012-10-23 Uri Abraham , Robert Bonnet , Wieslaw Kubis

Let $d, r \in \N$, $\|\cdot\|$ any norm on $\R^d$ and $B$ denote the unit ball with respect to this norm. We show that any sequence $v_1,v_2,...$ of vectors in $B$ can be partitioned into $r$ subsequences $V_1, ..., V_r$ in a balanced…

Combinatorics · Mathematics 2007-05-23 Imre Bárány , Benjamin Doerr

Vaught's Conjecture states that if $T$ is a complete first order theory in a countable language that has more than $\aleph_0$ pairwise non-isomorphic countably infinite models, then $T$ has $2^{\aleph_0}$ such models. Morley showed that if…

Logic · Mathematics 2018-11-21 M. Assem , T. S. Ahmed , G. Sági , D. Sziráki

The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…

Combinatorics · Mathematics 2015-09-25 Istvan Tomon
‹ Prev 1 8 9 10 Next ›