Intersection number and capacities of graphs

DOI10.1016/0012-365X(95)00011-KzbMath0855.05074OpenAlexW2126133596MaRDI QIDQ1896353

Yanyan Li

Publication date: 12 January 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00011-k

zbMATH Keywords

intersection numbergraph capacitiesSperner capacities

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Graph theory (05C99)

Related Items (3)

On the extremal combinatorics of the Hamming space ⋮ The Sperner capacity of linear and nonlinear codes for the cyclic triangle ⋮ On the capacity of Boolean graph formulæ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applications of edge coverings by cliques
• On qualitatively independent partitions and related problems
• On the maximum number of qualitative independent partitions
• On the ratio of optimal integral and fractional covers
• Parallel concepts in graph theory
• Capacities: From information theory to extremal set theory
• Sperner capacities
• Orthogonal partitions and covering of graphs
• The Representation of a Graph by Set Intersections
• Indépendance d'ensembles et prolongement de mesures (Résultats et problèmes)
• Sur deux propriétés des classes d'ensembles

This page was built for publication: Intersection number and capacities of graphs