Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On one combinatorial problem of Erdös

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

zbMath1282.05208MaRDI QIDQ886591

Dmitriy A. Shabanov

Publication date: 27 June 2007

Published in: Doklady Mathematics (Search for Journal in Brave)



Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)


Related Items (6)

On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ 2-colorings of hypergraphs with large girth ⋮ Extremal problems in hypergraph colourings ⋮ Upper bound in the Erdős-Hajnal problem of hypergraph coloring ⋮ On balanced colorings of hypergraphs ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)







This page was built for publication: On one combinatorial problem of Erdös

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:886591&oldid=12839398"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 15:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki