Constructing union-free pairs of k-element subsets

zbMATH Open1373.05129MaRDI QIDQ2443418FDOQ2443418

Authors: Gyula O. H. Katona 

Publication date: 7 April 2014

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• On families of sets without \(k\) pairwise disjoint members
• Hypergraphs in which all disjoint pairs have distinct unions
• Union-free families of sets and equations over fields
• Pairs of disjoint \(q\)-element subsets far from each other
• scientific article; zbMATH DE number 15500

zbMATH Keywords

Hamiltonian cyclepairs of disjoint subsets

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65)

Cited In (6)

• Title not available (Why is that?)
• Generating All Sets With Bounded Unions
• Pairs of disjoint \(q\)-element subsets far from each other
• Note on generating all subsets of a finite set with disjoint unions
• Generating all subsets of a finite set with disjoint unions
• Binomial coefficients whose products are perfect kth powers

This page was built for publication: Constructing union-free pairs of \(k\)-element subsets

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