Ein kombinatorisches Problem von P. Erdős und A. Hajnal
From MaRDI portal
Publication:5518400
DOI10.1007/BF01897145zbMath0143.02501WikidataQ56444798 ScholiaQ56444798MaRDI QIDQ5518400
Publication date: 1964
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Related Items (19)
On a combinatorial problem. II ⋮ On proper colorings of hypergraphs ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ The Mathematical Work of Wolfgang Schmidt ⋮ On-line algorithms for 2-coloring hypergraphs via chip games ⋮ On a combinatorial game ⋮ Extremal problems among subsets of a set. (Reprint) ⋮ Greedy colorings of uniform hypergraphs ⋮ An extremal problem in hypergraph coloring ⋮ On proper colourings of hypergraphs using prescribed colours ⋮ On a combinatorial problem of P. Erdős and L. Lovasz ⋮ Improvement of the lower bound in the Erdös-Hajnal combinatorial problem ⋮ Optimisation and hypergraph theory ⋮ The \(B_r\) property and chromatic numbers of generalized graphs ⋮ Separability properties of almost-disjoint families of sets ⋮ Extremal problems among subsets of a set ⋮ On property \(B_r\) ⋮ Sparse colour-critical hypergraphs
This page was built for publication: Ein kombinatorisches Problem von P. Erdős und A. Hajnal
