Sur deux propriétés des classes d'ensembles

Cited In (46)

Pathwidth of Circular-Arc Graphs
On the iterated biclique operator
The Weak Topology of a Banach Space
Expander properties and the cover time of random intersection graphs
Characterizations of fuzzy interval graphs
Primitive groups synchronize non-uniform maps of extreme ranks
Representing orders by moving figures in space
Unique intersectability of diamond-free graphs
On graphs of bounded semilattices
Intersection properties of line graphs
Common factors of integers: A graphic view
On the iterated edge-biclique operator
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
Extending partial representations of interval graphs
Isoperimetric numbers of randomly perturbed intersection graphs
Ferrers dimension and boxicity
Title not available (Why is that?)
Recognizing interval digraphs and interval bigraphs in polynomial time
A survey on the Intersection graphs of ideals of rings
Intersection number and capacities of graphs
On edge-sets of bicliques in graphs
On a graph isomorphic to its intersection graph: self-graphoidal graphs
Paired threshold graphs
Maximum independent set and maximum clique algorithms for overlap graphs
Intersection graphs of ideals of rings
Paul Erdős, 1913-1996
Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
On set systems determined by intersections
The graphs of semirings
Intersection graphs of ideals of rings
Large independent sets in general random intersection graphs
Title not available (Why is that?)
Almost every graph is divergent under the biclique operator
Subtree filament graphs are subtree overlap graphs
Foundations of a connectivity theory for simplicial complexes
Constructing an indeterminate string from its associated graph
Constant tolerance intersection graphs of subtrees of a tree
On the algebraic union of strongly measure zero sets and their relatives with sets of real numbers
On the edge‐biclique graph and the iterated edge‐biclique operator
Applications of edge coverings by cliques
Complexity of representation of graphs by set systems
Measures in Boolean Algebras
Vertex removal in biclique graphs
Sharp thresholds for Hamiltonicity in random intersection graphs
The intersection numbers of a complex
Sur la relation d'inclusion et l'axiome de choix de Zermelo

This page was built for publication: Sur deux propriétés des classes d'ensembles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5835102)