scientific article; zbMATH DE number 3461973

MaRDI QIDQ4047583zbMATH OpenFDO

Authors C. Berge

Publication date 1974

Mathematics Subject Classification ID

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

Cited in

(25)

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

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)