Maximum degree and fractional matchings in uniform hypergraphs (Q1168988): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zoltan Fueredi / rank
Normal rank
 
Property / author
 
Property / author: Zoltan Fueredi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Problems and Hypergraph Theory: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN MAXIMAL DEGREE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal matchings in graphs with given minimal and maximal degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intersecting families of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708835 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02579271 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984103551 / rank
 
Normal rank

Latest revision as of 09:53, 30 July 2024

scientific article
Language Label Description Also known as
English
Maximum degree and fractional matchings in uniform hypergraphs
scientific article

    Statements

    Maximum degree and fractional matchings in uniform hypergraphs (English)
    0 references
    1981
    0 references
    uniform hypergraphs
    0 references
    intersecting hypergraphs
    0 references
    fractional transversal
    0 references
    projective planes
    0 references
    r-partite hypergraphs
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references