Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dmitriy A. Shabanov / rank
Normal rank
 
Property / author
 
Property / author: Dmitriy A. Shabanov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2971674625 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1909.00448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of hypergraphs with \(r\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings of hypergraphs with large number of colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark concerning arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on panchromatic colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on random greedy coloring of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring uniform hypergraphs with few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of sparse uniform hypergraphs with high chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipass greedy coloring of simple uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for colorings of simple hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colourings of Uniform Hypergraphs with Large Girth and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy colorings of uniform hypergraphs / 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: The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random coloring method in the combinatorial problem of Erdős and Lovász / rank
 
Normal rank

Latest revision as of 20:54, 21 July 2024

scientific article
Language Label Description Also known as
English
Coloring hypergraphs with bounded cardinalities of edge intersections
scientific article

    Statements

    Coloring hypergraphs with bounded cardinalities of edge intersections (English)
    0 references
    20 February 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    colorings of hypergraphs
    0 references
    \(b\)-simple hypergraphs
    0 references
    random recoloring method
    0 references
    0 references
    0 references