Results 71 to 80 of about 107 (87)

An application of the combinatorial Nullstellensatz to a graph labelling problem

Journal of Graph Theory, 2010
AbstractAn antimagic labelling of a graph G with m edges and n vertices is a bijection from the set of edges of G to the set of integers {1,…,m}, such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it admits an antimagic labelling.
Dan Hefetz
exaly   +3 more sources

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

Designs, Codes, and Cryptography, 2021
AbstractThe long-standing Erdős–Faber–Lovász 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 stronger conjecture.
Zoltan Lorant Nagy, Oliver Janzer
exaly   +6 more sources

Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz

Discrete Applied Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jakub Przybyło
exaly   +2 more sources

A Short Proof of Combinatorial Nullstellensatz

American Mathematical Monthly, 2010
Mateusz Michałek
exaly   +2 more sources

Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz

SIAM Journal on Discrete Mathematics, 2013
Consider a simple graph $G=(V,E)$ and its proper edge coloring $c$ with the elements of the set $\{1,2,\ldots,k\}$ (or any other $k$-element set of real numbers). We say that $c$ is neighbor sum distinguishing if $\sum_{w\in N_G(v)}c(wv)\neq \sum_{w\in N_G(u)}c(wu)$ for every edge $uv\in E$.
Jakub Przybyło
exaly   +2 more sources

Neighbor sum distinguishing total colorings via the Combinatorial Nullstellensatz

Science China Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Guiying
exaly   +3 more sources

Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz

Graphs and Combinatorics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiguo Yu, Jian-Liang Wu, Wu Jianliang
exaly   +3 more sources

Combinatorial Nullstellensatz and Turán numbers of complete r-partite r-uniform hypergraphs

Discrete Mathematics
3 ...
Alexey Gordeev
exaly   +3 more sources

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Journal of Graph Theory, 2014
AbstractConsider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v.
Jakub Przybylo, Tsai-Lien Wong
openaire   +2 more sources

4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz

Discrete Mathematics, 2023
Jian-Liang Wu, Jian-Liang Wu, Fan Yang   +2 more
exaly