Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz

Autor: Oliver Janzer, Zoltán Lóránt Nagy

Publikováno v: Designs, Codes and Cryptography, 90 (9)

The long-standing Erdos-Faber-Lovasz conjecture states that every n-uniform linear hypergaph with n edges has a proper vertex-coloring using n colors. In this paper we propose an algebraic framework to the problem and formulate a corresponding strong

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2fdb429bd9a97f074e1343aa830f0590

The m-Bézout Bound and Distance Geometry

Autor: Ioannis Z. Emiris, Evangelos Bartzos, Charalambos Tzamos

Publikováno v: CASC 2021-23rd International Workshop Computer Algebra in Scientific Computing
CASC 2021-23rd International Workshop Computer Algebra in Scientific Computing, Sep 2021, Sochi, Russia. ⟨10.1007/978-3-030-85165-1_2⟩
Computer Algebra in Scientific Computing ISBN: 9783030851644
CASC

International audience; We offer a closed form bound on the m-Bézout bound for multi-homogeneous systems whose equations include two variable subsets of the same degree. Our bound is expectedly not tight, since computation of the m-Bézout number is

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bc038729e88a760b6d40fb82ca6e69c
https://hal.science/hal-03523833

Obstructions for local tournament orientation completions

Autor: Hsu, Kevin

The orientation completion problem for a hereditary class C of oriented graphs asks whether a given partially oriented graph can be completed to a graph belonging to C. This problem was introduced recently and is a generalization of several existing

Externí odkaz: http://hdl.handle.net/1828/12024

Parameterized Orientable Deletion

Autor: Tesshu Hanaka, Florian Sikora, Ioannis Katsikarelis, Yota Otachi, Michael Lampis

Publikováno v: Algorithmica
Algorithmica, Springer Verlag, 2020, 82 (7), pp.1909-1938. ⟨10.1007/s00453-020-00679-6⟩
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
SWAT 2018
SWAT 2018, Jun 2018, Malmö, Sweden. pp.24:1-24:13

A graph is $d$-orientable if its edges can be oriented so that the maximum in-degree of the resulting digraph is at most $d$. $d$-orientability is a well-studied concept with close connections to fundamental graph-theoretic notions and applications a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35425c07b6045347935f368ae7cddac3

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.