An extremal problem in hypergraph coloring (Q1235714): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(77)90007-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965661731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equipartite colorings in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On A Combinatorial Problem III / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(B_r\) property and chromatic numbers of generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein kombinatorisches Problem von P. Erdős und A. Hajnal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Puncture sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Un problème extremal pour les graphes et les hypergraphes / rank
 
Normal rank

Latest revision as of 19:56, 12 June 2024

scientific article
Language Label Description Also known as
English
An extremal problem in hypergraph coloring
scientific article

    Statements

    Identifiers