English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

As starting point, we formulate a corollary to the Quantitative CombinatorialNullstellensatz. This corollary does not require the consideration of anycoefficients of polynomials, only evaluations of polynomial functions. Incertain situations, our corollary is more directly applicable and moreready-to-go than the Combinatorial Nullstellensatz itself. It is also ofinterest from a numerical point of view. We use it to explain a well-knownconnection between the sign of 1-factorizations (edge colorings) and the ListEdge Coloring Conjecture. For efficient calculations and a better understandingof the sign, we then introduce and characterize the sign of single 1-factors.We show that the product over all signs of all the 1-factors in a1-factorization is the sign of that 1-factorization. Using this result in analgorithm, we attempt to prove the List Edge Coloring Conjecture for all graphswith up to 10 vertices. This leaves us with some exceptional cases that need tobe attacked with other methods.

Orientations of 1-Factorizations and the List Chromatic Index of Small Graphs