A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem (Q2439129)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6266368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem |
scientific article; zbMATH DE number 6266368 |
Statements
A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem (English)
0 references
7 March 2014
0 references
transversal
0 references
hypergraph
0 references
edge coloring
0 references
matchings
0 references
multigraph
0 references
0.8784117698669434
0 references
0.8766380548477173
0 references
0.8523820042610168
0 references
0.8361018300056458
0 references
0.82416832447052
0 references
