Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three (Q4908832): Difference between revisions

From MaRDI portal
Changed an 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.1002/jgt.21640 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148998475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of complete graphs into triangles and Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence, clique size and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in triangle-free cubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds on the size of a maximum matching in a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence in graphs with maximum degree four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size and independence in triangle‐free graphs with maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph domination and strong independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in uniform hypergraphs with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in large uniform hypergraphs with large minimum collective degree / rank
 
Normal rank

Latest revision as of 06:51, 6 July 2024

scientific article; zbMATH DE number 6142493
Language Label Description Also known as
English
Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three
scientific article; zbMATH DE number 6142493

    Statements

    Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three (English)
    0 references
    0 references
    0 references
    0 references
    7 March 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    independence
    0 references
    matching
    0 references
    hypergraph
    0 references
    rank
    0 references
    0 references