Add to ORKGRésumé. Dans cet article, nous décrivons les sous-réseaux de certains réseaux de Coxeter, prolongeant les résultats de [Ber]. Notre description utilise des graphes. Abstract. In this paper, we describe the sublattices of some lattices, extending previous results of [Ber]. Our description makes intensive use of graphs. 1
AbstractConcept lattices (also called Galois lattices) are an ordering of the maximal rectangles def...
AbstractIt is shown that each element of the lattice of meet (resp., join) sublattices of a product ...
This thesis consists of two independent parts. In the rst part of the thesis, we develop a Riemann-R...
Résumé. Dans cet article, nous décrivons les sous-réseaux de cer-tains réseaux de Coxeter, prol...
Abstract. In this paper, we describe the sublattices of some lattices, extending previous results of...
Abstract. Polytopes from subgraph statistics are important in applications and con-jectures and theo...
AbstractIt was recently proved by Pudlák and Tůma that every finite lattice L can be represented as ...
Let r≥2 and c\u3e0. Every graph on n vertices with at least cn r cliques on r vertices contains a co...
The paper is aimed at the description of subsemilattice finite lattices, their sublattice infinite l...
In a broad sense, graph theory has always been present in civilization. Graph theory is the math of ...
The set of all convex sublattices CS(L) of a lattice L have been studied by a new approach. Introduc...
This thesis present three results. The first is a result in structural graph theory. It demonstr...
summary:We attach to each $\langle 0,\vee \rangle$-semilattice $\boldsymbol S$ a graph $\boldsymbol ...
International audienceConcept lattices (also called Galois lattices) are an ordering of the maximal ...
AbstractA description of perfect lattices Γ(Un) generated by the L-polytopes Un is given. Γ(Un) is t...
AbstractConcept lattices (also called Galois lattices) are an ordering of the maximal rectangles def...
AbstractIt is shown that each element of the lattice of meet (resp., join) sublattices of a product ...
This thesis consists of two independent parts. In the rst part of the thesis, we develop a Riemann-R...
Résumé. Dans cet article, nous décrivons les sous-réseaux de cer-tains réseaux de Coxeter, prol...
Abstract. In this paper, we describe the sublattices of some lattices, extending previous results of...
Abstract. Polytopes from subgraph statistics are important in applications and con-jectures and theo...
AbstractIt was recently proved by Pudlák and Tůma that every finite lattice L can be represented as ...
Let r≥2 and c\u3e0. Every graph on n vertices with at least cn r cliques on r vertices contains a co...
The paper is aimed at the description of subsemilattice finite lattices, their sublattice infinite l...
In a broad sense, graph theory has always been present in civilization. Graph theory is the math of ...
The set of all convex sublattices CS(L) of a lattice L have been studied by a new approach. Introduc...
This thesis present three results. The first is a result in structural graph theory. It demonstr...
summary:We attach to each $\langle 0,\vee \rangle$-semilattice $\boldsymbol S$ a graph $\boldsymbol ...
International audienceConcept lattices (also called Galois lattices) are an ordering of the maximal ...
AbstractA description of perfect lattices Γ(Un) generated by the L-polytopes Un is given. Γ(Un) is t...
AbstractConcept lattices (also called Galois lattices) are an ordering of the maximal rectangles def...
AbstractIt is shown that each element of the lattice of meet (resp., join) sublattices of a product ...
This thesis consists of two independent parts. In the rst part of the thesis, we develop a Riemann-R...