On two-colorings of hypergraphs (Q656242): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On a property of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvement of the lower bound in the Erdös-Hajnal combinatorial problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s1064562411010157 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035082269 / rank
 
Normal rank

Latest revision as of 10:44, 30 July 2024

scientific article
Language Label Description Also known as
English
On two-colorings of hypergraphs
scientific article

    Statements

    Identifiers