AbstractIn 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. B 13 (1972), 226–241) in particular in that isolated vertices are admitted. As a corollary we obtain a result due to J.-L. Paillet
RésuméEuclidean buildings are examples of hyperbolic spaces: their distance d verify the CAT(0) ineq...
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
AbstractWe introduce the ‘edges-paths hypergraph of a tree’ and study relations of this notion with ...
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
AbstractH. Whitney proved that, apart from a simple exeptional case, whenever the line graphs of two...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
Considering uniform hypergraphs, we prove that for every non-negative integer h there exist two non-...
Considering uniform hypergraphs, we prove that for every non-negative integer h there exist two non-...
19 pages, francaisWe compute the characteristic polynomials of the posets of hypertrees. We show tha...
Dans cette thèse, nous considérons plusieurs paramètres des hypergraphes et nous étudions si les res...
19 pages, francaisWe compute the characteristic polynomials of the posets of hypertrees. We show tha...
RésuméEuclidean buildings are examples of hyperbolic spaces: their distance d verify the CAT(0) ineq...
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
AbstractWe introduce the ‘edges-paths hypergraph of a tree’ and study relations of this notion with ...
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
AbstractH. Whitney proved that, apart from a simple exeptional case, whenever the line graphs of two...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
Considering uniform hypergraphs, we prove that for every non-negative integer h there exist two non-...
Considering uniform hypergraphs, we prove that for every non-negative integer h there exist two non-...
19 pages, francaisWe compute the characteristic polynomials of the posets of hypertrees. We show tha...
Dans cette thèse, nous considérons plusieurs paramètres des hypergraphes et nous étudions si les res...
19 pages, francaisWe compute the characteristic polynomials of the posets of hypertrees. We show tha...
RésuméEuclidean buildings are examples of hyperbolic spaces: their distance d verify the CAT(0) ineq...
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
ABSTRACT. A procedure for determining whether two graphs are isomorphic is described. During the pro...