Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3754700

From MaRDI portal
Publication:3937405
Jump to:navigation, search

zbMATH Open0481.05002MaRDI QIDQ3937405FDOQ3937405


Authors: P. Erdős Edit this on Wikidata


Publication date: 1979



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




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
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • 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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3937405&oldid=17623002"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 22:34. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki