On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2011.11.035 / rank
Normal rank
 
Property / author
 
Property / author: Patric R. J. Östergård / rank
Normal rank
 
Property / author
 
Property / author: Patric R. J. Östergård / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: nauty / rank
 
Normal rank
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.1016/j.dam.2011.11.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076287179 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56444805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On A Combinatorial Problem of Erdös / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Property <i>B</i> of Families of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several new lower bounds on the size of codes with covering radius one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On A Combinatorial Problem III / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The football pool problem for 5 matches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification algorithms for codes and designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorph-Free Exhaustive Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of optimal binary codes of length 9 and covering radius 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the football pool problem for six matches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on a Combinatorial Problem of ErdŐS and Hajnal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Inequalities for the Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068746 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dam/Ostergard14 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2011.11.035 / rank
 
Normal rank

Latest revision as of 15:06, 18 December 2024

scientific article
Language Label Description Also known as
English
On the minimum size of 4-uniform hypergraphs without property \(B\)
scientific article

    Statements

    On the minimum size of 4-uniform hypergraphs without property \(B\) (English)
    0 references
    7 February 2014
    0 references
    graph coloring
    0 references
    hypergraph
    0 references
    property \(B\)
    0 references

    Identifiers