Hypergraphes de chaines d'aretes d'un arbre

We introduce the ‘edges-paths hypergraph of a tree’ and study relations of this notion with graphic geometries, chordable graphs. As particular case, we give a simple characterization of intervals hypergraphs.     

Graphes cubiques d'indice trois,graphes cubiques isochromatiques,graphes cubiques d'indice quatre

The process introduced by E. Johnson [Amer. Math. Monthly73 (1966), 52–55] for constructing connected cubic graphs can be modified so as to obtain restricted classes of cubic graphs, in particular, those defined by their chromatic number or their chromatic index. We construct here the graphs of chromatic number three and the graphs whose chromatic number is equal to its chromatic index (isochromatic graphs). We then give results about the construction of the class of graphs of chromatic index four, and in particular, we construct an infinite class of “snarks.”     

Une condition suffisante d'existence d'un circuit hamiltonien dans un graphe oriente

In this article we prove that a sufficient condition for an oriented strongly connected graph with n vertices to be Hamiltonian is: (1) for any two nonadjacent vertices x and y

$\text{d}{}^{\mathrm{+}}\text{(x)+d}{}^{\mathrm{?}}\text{(x)+d}{}^{\mathrm{+}}\text{(y)+d}{}^{\mathrm{?}}\text{(y)?sn?1}$

.     

Isomorphismes d'hypergraphes par intersections équicardinales d'arêtes et configurations exclues

In this note we characterize isomorphism between two hypergraphs by means of equicardinality of certain edge intersections and the exclusion of certain pairs of subhypergraphs. Our result is slightly stronger than Theorem 3 of C. Berge and R. Rado (J. Combinatorial Theory Ser. B13 (1972), 226–241) in particular in that isolated vertices are admitted. As a corollary we obtain a result due to J.-L. Paillet.     

Polytope des independants d'un graphe serie-parallele

A graph is said to be serie-parallel if it doesn't contain an homeomorph to K₄. The aim of the paper is the demonstration of Chvatal's conjecture on the polytope of independent set of vertices in such graphs. This is done classically by using LP-duality, the algorithm for constructing the primal-dual solution having the nice property to be linear in the number of vertices.     

Partitions lineaires arguesiennes d'un espace vectoriel

In this work, we study linear and desarguesian partitions of a finite dimensional vector space over a skew-field K. When K is finite, we describe the set of all these partitions as a homogeneous space of the general linear group and we give an enumeration formula.     

Construction d'Orthogonaux dans les Groupes abéliens finis eet confusions d'effets dans les plans factoriels

This paper is devoted to factorial designs generated by Patterson's (1976) DSIGN method. As stated by Bailey (1977), the identification of confounded effects may be done here by constructing annihilators of given subgroups of the treatment group.     

Nombre chromatique total d'un hypergraphe

In this paper, the author defines a hypergraph total chromatic number and determines this number for the complete h-partite and for the complete h-uniform hypergraphs.     

Arbres minimaux d'un graphe preordonne

We study the minimal spanning trees of a connected graph G = (X,U) where U is partially preordered (or quasi-ordered). We characterize several kinds of optimal spanning trees and give conditions for existence of strongly optimal trees. Generalizations to bases of matroids (binary matroïds in part 2) are immediate. Sone of our results are given in terms of Krugdahl's dependence graphs. They imply previous results of Rosenstiehl and Gale in the case of linear orders or preorders.     

Maximal dimensional partially ordered sets I. Hiraguchi's theorem

In this paper, I give a new proof of Hiraguchi's Theorem that the dimension of an n-element partially ordered set is at most [frcase|1/2n]. The significant feature of the proof is the lemma which states that a partially ordered set has either a cover of rank 0 or a pair of covers with elements of one incomparable with elements of the other.     

Petites valeurs de la fonction d'Euler

Let φ be the Euler's function. A question of Rosser and Schoenfeld is answered, showing that there exists infinitely many n such that $\text{n}\text{φ(n)}\text{> e}{}^{\mathrm{y}}\text{log log}\text{n}$, where γ is the Euler's constant. More precisely, if N_k is the product of the first k primes, it is proved that, under the Riemann's hypothesis, $\text{N}{}_{\mathrm{k}}\text{φ(N}{}_{\mathrm{k}}\text{)}\text{> e}{}^{\mathrm{y}}\text{log log}\text{N}{}_{\mathrm{k}}$ holds for any k ≥ 2, and, if the Riemann's hypothesis is false this inequality holds for infinitely many k, and is false for infinitely many k.     

Le nombre minimal de colorations d'un hypergraphe k-chromatique

A (0,λ)-graph (λ?2) is a connected graph in which any two vertices have λ common neighbours or none at all. Such a graph is regular. When the diameter is at least four, a lower bound for the degree can be obtained. This lower bound is attained only by Hadamard graphs and n-cubes.     

Écoulement d'un fluide de Bingham dans un domaine non-cylindrique

We obtain an existence theorem for Bingham flows in a noncylindrical domain, as a simple application of a previous result on Bingham flows with a monotone perturbation.     

Le probleme d'etoiles pour graphes est np-complet

Nous appelons problème de ‘recollement de voisinages’ (RV) (‘star problem’ ou ‘problème d'ètoiles’) le problème qui consiste à savoir, étant donnée une famille $\text{V}$ de parties d'un ensemble S, s'il existe un graphe (non orienté et sans boucle) dont la famille de voisinages coïncide avec $\text{V}$. L'objectif de cet article est de montrer que le problème RV est NP-complet. La preuve s'appuiera sur l'èquivalence entre RV et le probléme de trouver un automorphisme d'ordre 2 dans un graphe quelconque (AUT2). La NP-complétude de AUT2 a été démontrée par Anna Lubiw [5].