Results 1 to 10 of about 1,670 (73)
Schwartz-Zippel bounds for two-dimensional products [PDF]
Discrete Analysis, 2017 Schwartz-Zippel bounds for two-dimensional products, Discrete Analysis 2017:20, A famous open problem in combinatorial geometry is Erdős's unit-distances problem, which asks the following: given a subset $A\subset\mathbb R^2$ of size $n$, how many ...
Hossein Nassajian Mojarrad +3 more
doaj +3 more sources
Combinatorial Nullstellensatz modulo prime powers and the Parity Argument [PDF]
The Electronic Journal of Combinatorics, 2014 We present new generalizations of Olson's theorem and of a consequence of Alon's Combinatorial Nullstellensatz. These enable us to extend some of their combinatorial applications with conditions modulo primes to conditions modulo prime powers. We analyze
Varga, László
core +5 more sources
Application of the Combinatorial Nullstellensatz to Integer-magic Graph Labelings
Theory and Applications of Graphs, 2022 Let $A$ be a nontrivial abelian group and $A^* = A \setminus \{0\}$. A graph is $A$-magic if there exists an edge labeling $f$ using elements of $A^*$ which induces a constant vertex labeling of the graph.
Richard Low, Dan Roberts
doaj +3 more sources
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs without Theta Graphs Θ2,1,2
Mathematics, 2021 A theta graph Θ2,1,2 is a graph obtained by joining two vertices by three internally disjoint paths of lengths 2, 1, and 2. A neighbor sum distinguishing (NSD) total coloring ϕ of G is a proper total coloring of G such that ∑z∈EG(u)∪{u}ϕ(z)≠∑z∈EG(v)∪{v}ϕ(
Donghan Zhang
doaj +1 more source
Graph choosability and double list colorability [PDF]
Opuscula Mathematica, 2010 In this paper, we give a sufficient condition for graph choosability, based on Combinatorial Nullstellensatz and a specific property, called "double list colorability", which means that there is a list assignment for which there are exactly two ...
Hamid-Reza Fanaï
doaj +1 more source
List circular backbone colouring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge.
Frederic Havet, Andrew D. King
doaj +1 more source
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
Discussiones Mathematicae Graph Theory, 2021 A proper [k]-total coloring c of a graph G is a proper total coloring c of G using colors of the set [k] = {1, 2, . . . , k}. Let p(u) denote the product of the color on a vertex u and colors on all the edges incident with u.
Dong Aijun, Li Tong
doaj +1 more source
Combinatorial Nullstellensatz and DP-coloring of graphs [PDF]
Discrete Mathematics, 2020 17 ...
Hemanshu Kaul, Jeffrey A. Mudrock
openaire +2 more sources
Bounding the monomial index and (1,l)-weight choosability of a graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Ben Seamone
doaj +1 more source
Tropical Combinatorial Nullstellensatz and Sparse Polynomials [PDF]
Foundations of Computational Mathematics, 2019 Tropical algebra emerges in many fields of mathematics such as algebraic geometry, mathematical physics and combinatorial optimization. In part, its importance is related to the fact that it makes various parameters of mathematical objects computationally accessible.
Grigoriev, Dima, Podolskii, Vladimir
openaire +3 more sources