Minimum clique-free subgraphs of Kneser graphs
From MaRDI portal
Publication:2243816
DOI10.1134/S1064562420060204zbMath1477.05126OpenAlexW3135888076MaRDI QIDQ2243816
S. G. Kiselev, A. Yu. Skorkin, S. V. Vahrushev, M. E. Zhukovskii
Publication date: 11 November 2021
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562420060204
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- \(K_{s,t}\)-saturated bipartite graphs
- Star saturation number of random graphs
- Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)
- Weak saturation numbers of complete bipartite graphs in the clique
- Exact bounds for some hypergraph saturation problems
- A Problem in Graph Theory
- Saturation in random graphs
This page was built for publication: Minimum clique-free subgraphs of Kneser graphs