Related papers: Siblings of countable cographs
We prove that for every ${\gamma > 0}$ there exists $n_0 \in \mathbb{N}$ such that for every ${n \geq n_0}$ any family of up to $\lfloor{n^{\frac12+\gamma}}\rfloor$ trees having at most $(1-\gamma)n$ vertices in each bipartition class can…
Motivated by the concept of well-covered graphs, we define a graph to be well-bicovered if every vertex-maximal bipartite subgraph has the same order (which we call the bipartite number). We first give examples of them, compare them with…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
Recently, Daligault, Rao and Thomass\'e asked in [3] if every hereditary class which is well-quasi-ordered by the induced subgraph relation is of bounded clique-width. There are two reasons why this questions is interesting. First, it…
We give an explicit description of the set of all factorization structures, or twisting maps, existing between the algebras k^2 and k^2, and classify the resulting algebras up to isomorphism. In the process we relate several different…
We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…
We prove that if A is a finite algebra with a parallelogram term that satisfies the split centralizer condition, then A is dualizable. This yields yet another proof of the dualizability of any finite algebra with a near unanimity term, but…
Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. In 1962, Erdos conjectured that the random 2-edge-coloring minimizes the number of…
Two cochain complexes are constructed for an algebra A and a coalgebra C entwined with each other via the map $\psi:C\otimes A\to A\otimes C$. One complex is associated to an A-bimodule, the other to a C-bicomodule. In the former case the…
We prove that any link admitting a diagram with a single negative crossing is strongly quasipositive. This answers a question of Stoimenow's in the (strong) positive. As a second main result, we give simple and complete characterizations of…
We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…
This short note, prepared for the Logic Colloquium 2014, provides an introduction to Davies-trees and presents new applications in infinite combinatorics. In particular, we give new and simple proofs to the following theorems of P.…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
A semiring scheme generalizes a scheme in such a way that the underlying algebra is that of semirings. We generalize \v{C}ech cohomology theory and invertible sheaves to semiring schemes. In particular, when $X=\mathbb{P}^n_M$, a projective…
We show that there are uncountably many countable lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many…
We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…
As an extension of positive or almost positive diagrams and links, we introduce a notion of successively almost positive diagrams and links, and good successively almost positive diagrams and links. We review various properties of positive…
We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two comparability subgraphs and this holds for almost all…