Sur deux propriétés des classes d'ensembles
From MaRDI portal
Publication:5835102
DOI10.4064/fm-33-1-303-307zbMath0060.12508OpenAlexW1214985307WikidataQ56532544 ScholiaQ56532544MaRDI QIDQ5835102
Publication date: 1945
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213098
Related Items
On the iterated edge-biclique operator ⋮ Subtree filament graphs are subtree overlap graphs ⋮ Intersection number and capacities of graphs ⋮ Common factors of integers: A graphic view ⋮ Intersection properties of line graphs ⋮ Unnamed Item ⋮ Characterizations of fuzzy interval graphs ⋮ Recognizing interval digraphs and interval bigraphs in polynomial time ⋮ Extending partial representations of interval graphs ⋮ Unnamed Item ⋮ Primitive groups synchronize non-uniform maps of extreme ranks ⋮ On the edge‐biclique graph and the iterated edge‐biclique operator ⋮ On graphs of bounded semilattices ⋮ Pathwidth of Circular-Arc Graphs ⋮ Constructing an indeterminate string from its associated graph ⋮ Maximum independent set and maximum clique algorithms for overlap graphs ⋮ Almost every graph is divergent under the biclique operator ⋮ The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs ⋮ Complexity of representation of graphs by set systems ⋮ On set systems determined by intersections ⋮ Unnamed Item ⋮ Paul Erdős, 1913-1996 ⋮ Large independent sets in general random intersection graphs ⋮ A survey on the Intersection graphs of ideals of rings ⋮ Intersection graphs of ideals of rings ⋮ Representing orders by moving figures in space ⋮ Intersection graphs of ideals of rings ⋮ On edge-sets of bicliques in graphs ⋮ Unique intersectability of diamond-free graphs ⋮ On the Iterated Biclique Operator ⋮ Foundations of a connectivity theory for simplicial complexes ⋮ Constant tolerance intersection graphs of subtrees of a tree ⋮ Sharp thresholds for Hamiltonicity in random intersection graphs ⋮ Ferrers dimension and boxicity ⋮ The graphs of semirings ⋮ The intersection numbers of a complex ⋮ Paired threshold graphs ⋮ On the algebraic union of strongly measure zero sets and their relatives with sets of real numbers ⋮ Sur la relation d'inclusion et l'axiome de choix de Zermelo ⋮ Applications of edge coverings by cliques ⋮ Expander properties and the cover time of random intersection graphs ⋮ Vertex removal in biclique graphs ⋮ Isoperimetric numbers of randomly perturbed intersection graphs ⋮ The Weak Topology of a Banach Space ⋮ Measures in Boolean Algebras ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
