Fractional and integer matchings in uniform hypergraphs (Q2637239): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(9 intermediate revisions by 6 users not shown)
description / endescription / en
scientific article
scientific article; zbMATH DE number 6302962
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2013.11.006 / rank
Normal rank
 
Property / author
 
Property / author: Daniela Kühn / rank
Normal rank
 
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1293.05300 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-88-7642-475-5_7 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2013.11.006 / rank
 
Normal rank
Property / author
 
Property / author: Daniela Kühn / rank
 
Normal rank
Property / published in
 
Property / published in: The Seventh European Conference on Combinatorics, Graph Theory and Applications / rank
 
Normal rank
Property / publication date
 
11 June 2014
Timestamp+2014-06-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 11 June 2014 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6302962 / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum vertex degree
Property / zbMATH Keywords: minimum vertex degree / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054420934 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4213169460 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.6901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity lemmas for hypergraphs and quasi-randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees giving independent edges in a hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for Erdős' matching conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time perfect matchings in dense hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in 4-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in hypergraphs of large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree / 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
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II / rank
 
Normal rank

Latest revision as of 14:49, 28 December 2024

scientific article; zbMATH DE number 6302962
Language Label Description Also known as
English
Fractional and integer matchings in uniform hypergraphs
scientific article; zbMATH DE number 6302962

    Statements

    Fractional and integer matchings in uniform hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    10 February 2014
    0 references
    11 June 2014
    0 references
    perfect matching
    0 references
    \(k\)-uniform hypergraph
    0 references
    minimum vertex degree
    0 references

    Identifiers

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