Covering graphs by the minimum number of equivalence relations (Q1103644): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q100329040, #quickstatements; #temporary_batch_1705549208013
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Noga Alon / rank
Normal rank
 
Property / author
 
Property / author: Noga Alon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for sets with applications to graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3961028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Representation of a Graph by Set Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Graphs by Equivalence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a clique covering problem of Orlin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a problem of A. Ehrenfeucht and J. Mycielski / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4106341 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:31, 18 June 2024

scientific article
Language Label Description Also known as
English
Covering graphs by the minimum number of equivalence relations
scientific article

    Statements

    Covering graphs by the minimum number of equivalence relations (English)
    0 references
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    equivalence graph
    0 references
    minimum number of equivalence subgraphs
    0 references
    minimum number of complete subgraphs
    0 references
    probabilistic arguments
    0 references
    0 references
    0 references