Minimum clique-free subgraphs of Kneser graphs (Q2243816): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Problem in Graph Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5558932 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4133994 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(K_{s,t}\)-saturated bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact bounds for some hypergraph saturation problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Saturation in random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Star saturation number of random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weak saturation numbers of complete bipartite graphs in the clique / rank | |||
Normal rank |
Revision as of 03:03, 27 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum clique-free subgraphs of Kneser graphs |
scientific article |
Statements
Minimum clique-free subgraphs of Kneser graphs (English)
0 references
11 November 2021
0 references
Kneser graphs
0 references
saturation number
0 references
weak saturation number
0 references