Clique number of Xor products of Kneser graphs

DOI10.1016/j.disc.2022.112886zbMath1489.05151arXiv2104.13505OpenAlexW3158912403MaRDI QIDQ2138983

Ádám Schweitzer, András Imolay, Anett Kocsis

Publication date: 17 May 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.13505

zbMATH Keywords

extremal set theoryintersecting familiesXor product

Mathematics Subject Classification ID

Extremal set theory (05D05) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Two-part set systems
• Kneser's conjecture, chromatic number, and homotopy
• Graph products and monochromatic multiplicities
• Independence number of products of Kneser graphs
• Intersecting families of discrete structures are typically trivial
• Codes and Xor graph products
• On the diameter of Kneser graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Almost Intersecting Families of Sets
• Results on intersecting families of subsets, a survey
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Mutually orthogonal Latin squares: A brief survey of constructions

This page was built for publication: Clique number of Xor products of Kneser graphs