Saturation in Kneser graphs

DOI10.1134/S0001434624070150MaRDI QIDQ6636281zbMATH OpenFDO

Authors S. V. Vakhrushev, M. E. Zhukovskii, A. Yu. Skorkin

Publication date 12 November 2024

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0001434624070150

zbMATH Keywords

Kneser graphsaturation numbertriangle

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• MinimumK_{2, 3}-Saturated Graphs
• Triangle-free Hamiltonian Kneser graphs
• The saturation number of \(K_{3,3}\)
• Graph saturation in multipartite graphs
• Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph

Cites work

• A Problem in Graph Theory
• scientific article; zbMATH DE number 3458659 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Intersection theorems with geometric consequences
• Kneser's conjecture, chromatic number, and homotopy
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• On the diameter of Kneser graphs
• On the stability of the independence number of a random subgraph
• Triangle-free Hamiltonian Kneser graphs

This page was built for publication: Saturation in Kneser graphs

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