Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz |
| |
Authors: | Janzer,Oliver,Nagy,Zolt n L r nt |
| |
Affiliation: | Janzer,Oliver,Nagy,Zoltán Lóránt |
| |
Abstract: | Designs, Codes and Cryptography - The long-standing Erdős–Faber–Lovász conjecture states that every n-uniform linear hypergaph with n edges has a proper vertex-coloring using... |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|