Polynomial-time partition of a graph into cliques.
Plotnikov, Anatoly D. (1996)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Mnëv's universality theorem revisited.”
Polynomial-time partition of a graph into cliques.
Restricted partitions.
Jakimczuk, Rafael (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The Tutte polynomial of a morphism of matroids I. Set-pointed matroids and matroid perspectives
Michel Las Vergnas (1999)
Annales de l'institut Fourier
Similarity:
We study the basic algebraic properties of a 3-variable Tutte polynomial the author has associated with a morphism of matroids, more precisely with a matroid strong map, or matroid perspective in the present paper, or, equivalently by the Factorization Theorem, with a matroid together with a distinguished subset of elements. Most algebraic properties of the usual 2-variable Tutte polynomial of a matroid generalize to the 3-variable polynomial. Among specific properties we show that the...
A new two-variable generalization of the chromatic polynomial.
Dohmen, Klaus, Poenitz, André, Tittmann, Peter (2003)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
On the number of terms of a composite polynomial
Umberto Zannier (2007)
Acta Arithmetica
Similarity:
On some properties of polynomial functions
R. Ger (1971)
Annales Polonici Mathematici
Similarity:
Intersective sets given by a polynomial
Jason Lucier (2006)
Acta Arithmetica
Similarity:
A formula for the supersingular polynomial
Luís R. A. Finotti (2009)
Acta Arithmetica
Similarity:
A generalization of a polynomial lemma of Leja
J. Siciak (1971)
Annales Polonici Mathematici
Similarity:
Explicit constructions of extractors and expanders
Norbert Hegyvári, François Hennecart (2009)
Acta Arithmetica
Similarity:
A generating function for the generalised Rice's polynomial
V. L. Deshpande, V. M. Bhise (1970)
Matematički Vesnik
Similarity:
On Waring's problem with polynomial summands II: Addendum
Hong Bing Yu (2001)
Acta Arithmetica
Similarity:
Combinatorial Nullstellensatz approach to polynomial expansion
Fedor Petrov (2014)
Acta Arithmetica
Similarity:
Applying techniques similar to Combinatorial Nullstellensatz we prove a lower estimate of |f(A,B)| for finite subsets A, B of a field, and a polynomial f(x,y) of the form f(x,y) = g(x) + yh(x), where the degree of g is greater than that of h.
The reduced length of a polynomial with complex coefficients
A. Schinzel (2008)
Acta Arithmetica
Similarity:
Addendum to the paper: "On the number of terms of a composite polynomial" (Acta Arith. 127 (2007), 157-167)
Umberto Zannier (2009)
Acta Arithmetica
Similarity: