Degree Conditions for Matchability in 3‐Partite Hypergraphs (Q4604015): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jgt.22140 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1605.05667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a lower bound for the connectivity of the independence complex of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings in \(r\)-partite \(r\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent systems of representatives in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Generalization of the Ryser-Brualdi-Stein Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hall's theorem for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings in bipartite multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Matrix Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering radius for sets of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets not belonging to algebras and rainbow matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals in row-latin rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the length of a partial transversal in a Latin square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large matchings in bipartite graphs have a rainbow matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique complex and hypergraph matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination numbers and homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings and rainbow connectedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals of latin squares and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JGT.22140 / rank
 
Normal rank

Latest revision as of 14:48, 30 December 2024

scientific article; zbMATH DE number 6843118
Language Label Description Also known as
English
Degree Conditions for Matchability in 3‐Partite Hypergraphs
scientific article; zbMATH DE number 6843118

    Statements

    Degree Conditions for Matchability in 3‐Partite Hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2018
    0 references
    matchings
    0 references
    3-partite hypergraphs
    0 references

    Identifiers

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