scientific article; zbMATH DE number 3461973

zbMATH Open0295.05130MaRDI QIDQ4047583FDOQ4047583

Authors: C. Berge 

Publication date: 1974

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cited In (23)

• Large non-trivial \(t\)-intersecting families of signed sets
• The Erdős-Ko-Rado properties of set systems defined by double partitions
• Compression and Erdős-Ko-Rado graphs
• Erdős-Ko-Rado theorems for chordal graphs and trees
• On Chvàtal's conjecture and a conjecture on families of signed sets
• The Erdös-Ko-Rado Theorem for Integer Sequences
• Cross-intersecting families of vectors
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Some extremal results on hypergraph Turán problems
• A Hilton-Milner-type theorem and an intersection conjecture for signed sets
• The diametric theorem in Hamming spaces---optimal anticodes
• Cross-Intersecting Families of Vectors
• Multiple cross-intersecting families of signed sets
• On \(t\)-intersecting families of signed sets and permutations
• The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
• More on the Erdős-Ko-Rado theorem for integer sequences
• On intersecting families of independent sets in trees
• On symmetric intersecting families of vectors
• Intersection theorems for t-valued functions
• A sharp bound for the product of weights of cross-intersecting families
• Strongly intersecting integer partitions
• Nombre chromatique total d'un hypergraphe
• A generalization of Talbot's theorem about King Arthur and his knights of the round table

This page was built for publication:

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