On uniform intersection numbers
An intersection graph \(G(F)\) of a family \(F\) of sets is a graph whose vertex set is \(F\) and in which two vertices are adjacent if and only if their intersection (as sets) is non-empty. The intersection number of a graph \(G\) is the minimum number of sets of a family \(F\) such that \(G\cong G(F)\). Similarly the uniform intersection number of \(G\) is defined; in this case an additional condition is required that all sets of \(F\) have equal cardinality. The paper studies these numbers and also their variants in whose definitions multifamilies instead families are considered; in a multifamily the same set may occur more than once.
- An intersection-union theorem for integer sequences
- scientific article; zbMATH DE number 4198044 (Why is no real title available?)
- Uniform intersection set-labelings of a graph. I: Regularisable graphs
- scientific article; zbMATH DE number 19218 (Why is no real title available?)
- scientific article; zbMATH DE number 1195742 (Why is no real title available?)
- Generalized arithmetic intersection numbers
- scientific article; zbMATH DE number 1339494 (Why is no real title available?)
- scientific article; zbMATH DE number 1045791 (Why is no real title available?)
This page was built for publication: On uniform intersection numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2715956)
