Recognizing Graph Theoretic Properties with Polynomial Ideals
نویسندگان
چکیده
منابع مشابه
Recognizing Graph Theoretic Properties with Polynomial Ideals
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial method and show how the algorithmic theory of polynomial ideals can be used to detect k-colorability, unique Hamiltonicity, and automorphism r...
متن کاملGraph Theoretic Properties of the Darkweb
We collect and analyze the darkweb (a.k.a. the “onionweb”) hyperlink graph. We find properties highly dissimilar to the well-studied world wide web hyperlink graph; for example, our analysis finds that >87% of darkweb sites never link to another site. We compare our results to prior work on world-wide-web and speculate about reasons for their differences. We conclude that in the term “darkweb”,...
متن کاملCombinatorial Properties of a Rooted Graph Polynomial
For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine combinatorial properties of this polynomial, proving that G is k-edge connected iff EV ′(G; 1) = · · · = EV k−1(G; 1) = 0. We find bounds on the first and second derivatives of EV (G; p); applications yield character...
متن کاملPolynomial hierarchy graph properties in hybrid logic
In this article, we show that for each property of graphs G in the Polynomial Hierarchy (PH) there is a sequence φ1, φ2, . . . of formulas of the full hybrid logic which are satisfied exactly by the frames in G. Moreover, the size of φn is bounded by a polynomial in n. These results lead to the definition of syntactically defined fragments of hybrid logic whose model checking problem is complet...
متن کاملPerturbation of Polynomial Ideals
In this paper we explore the interrelationship between the theory of polynomial ideals and certain branches of analysis including multivariate approximation theory and linear partial differential equations. Specifically, we use the perturbation technique from analysis to study the codimension of a multivariate polynomial ideal. Let K be a field. In this paper, K will often be the field C of com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2010
ISSN: 1077-8926
DOI: 10.37236/386