scientific article; zbMATH DE number 3754700

MaRDI QIDQ3937405zbMATH OpenFDO

Authors P. Erdős

Publication date 1979

zbMATH Keywords

ProblemsCombinatorial AnalysisGraph Theory

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Problem books (00A07) Graph theory (05Cxx) Enumerative combinatorics (05Axx)

Cited in

(8)

• Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New
• Improved bound on the maximum number of clique-free colorings with two and three colors
• The intersection spectrum of 3‐chromatic intersecting hypergraphs
• The intersection spectrum of 3-chromatic intersecting hypergraphs
• scientific article; zbMATH DE number 3749050 (Why is no real title available?)
• scientific article; zbMATH DE number 3668662 (Why is no real title available?)
• Problems and results in combinatorial analysis and graph theory
• Maximum number of sum-free colorings in finite abelian groups

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 Q3937405)