Compact representations of the intersection structure of families of finite sets

DOI10.1137/S0895480198348343MaRDI QIDQ2706199zbMATH OpenOpenAlexFDO

Authors János Körner, Angelo Monti

Publication date 19 March 2001

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480198348343

zbMATH Keywords

Kneser graphdimensioncoloring

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Extremal set theory (05D05)

Recommendations

• Publication:4945058
• The Chromatic Number of Kneser Hypergraphs
• Extremal problems concerning Kneser-graphs
• Kneser representations of graphs
• scientific article; zbMATH DE number 970797

Cited in

(6)

• On set intersection representations of graphs
• Onp-intersection representations
• Kneser ranks of random graphs and minimum difference representations
• Kneser ranks of random graphs and minimum difference representations
• scientific article; zbMATH DE number 1420986 (Why is no real title available?)
• scientific article; zbMATH DE number 3912387 (Why is no real title available?)

This page was built for publication: Compact representations of the intersection structure of families of finite sets

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