Zobrazeno 1 - 10
of 16
pro vyhledávání: '"John R. Schmitt"'
The conjecture, still widely open, posed by Marco Buratti, Peter Horak and Alex Rosa states that a list $L$ of $v-1$ positive integers not exceeding $\left\lfloor \frac{v}{2}\right\rfloor$ is the list of edge-lengths of a suitable Hamiltonian path of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44b08ba9549e0bb73c145e5781537d49
http://hdl.handle.net/11379/546425
http://hdl.handle.net/11379/546425
Publikováno v:
Combinatorics, Probability and Computing. 27:310-333
A 1993 result of Alon and F\"uredi gives a sharp upper bound on the number of zeros of a multivariate polynomial over an integral domain in a finite grid, in terms of the degree of the polynomial. This result was recently generalized to polynomials o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf034882f164826502b852f6961c68f0
https://doi.org/10.1017/s0963548317000566
https://doi.org/10.1017/s0963548317000566
Publikováno v:
Electronic Notes in Discrete Mathematics. 54:57-62
A 1993 result of Alon and Furedi gives a sharp upper bound on the number of zeros of a multivariate polynomial in a finite grid over an integral domain. We give a generalization of the Alon-Furedi Theorem and discuss the relationship between Alon-Fur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c64f0835778b82b5abb02a0c4f291d17
https://doi.org/10.1016/j.endm.2016.09.011
https://doi.org/10.1016/j.endm.2016.09.011
Publikováno v:
Combinatorica. 37:397-417
We present a restricted variable generalization of Warning's Second Theorem (a result giving a lower bound on the number of solutions of a low degree polynomial system over a finite field, assuming one solution exists). This is analogous to Schauz-Br
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f50e5acf60e4aa05890d6986bd0c2c68
https://doi.org/10.1007/s00493-015-3267-8
https://doi.org/10.1007/s00493-015-3267-8
Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq k$. We consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e54a25867c07b47d49c1883f5708c4c0
http://arxiv.org/abs/1809.02684
http://arxiv.org/abs/1809.02684
Publikováno v:
Journal of Combinatorics. 2:435-455
Given a family of graphs F , a graph G is F-saturated if no element of F is a subgraph of G, but for any edge e in G, some element of F is a subgraph of G + e. Let sat(n,F) denote the minimum number of edges in an F -saturated graph of order n. For g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88153311aa40ddfadc80cd520ae32778
https://doi.org/10.4310/joc.2011.v2.n3.a5
https://doi.org/10.4310/joc.2011.v2.n3.a5
Autor:
John R. Schmitt, Michael Ferrara
Publikováno v:
SIAM Journal on Discrete Mathematics. 23:517-526
We consider a variation of the classical Turan-type extremal problem as introduced by Erdos, Jacobson, and Lehel in [Graphs realizing the same degree sequences and their respective clique numbers, in Graph Theory, Combinatorics, and Applications, Vol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb0420b884b410f6078a5b65096e8ccb
https://doi.org/10.1137/080715275
https://doi.org/10.1137/080715275
Publikováno v:
Discrete Mathematics. 308(23):5712-5721
A nonincreasing sequence of nonnegative integers @p=(d"1,d"2,...,d"n) is graphic if there is a (simple) graph G of order n having degree sequence @p. In this case, G is said to realize@p. For a given graph H, a graphic sequence @p is potentiallyH-gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fe46c8a1ceee61e16d8ece5f11eac9d
Autor:
Ronald J. Gould, John R. Schmitt
Publikováno v:
Discrete Mathematics. 307:1108-1114
A graph G is said to be F-saturated if G does not contain a copy of F as a subgraph and G+e contains a copy of F as a subgraph for any edge e contained in the complement of G. Erdos et al. in [A problem in graph theory, Amer. Math. Monthly 71 (1964)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01f313fb3c26be430aac6e207c673821
https://doi.org/10.1016/j.disc.2006.08.004
https://doi.org/10.1016/j.disc.2006.08.004
Autor:
Michael Ferrara, John R. Schmitt
Publikováno v:
Electronic Notes in Discrete Mathematics. 28:131-135
We consider a variation of the classical Turan-type extremal problem as introduced by Erdős, Jacobson and Lehel in [Erdős, P., M. Jacobson, and J. Lehel, Graphs realizing the same degree sequence and their respective clique numbers, Graph Theory, C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da4d68db6ca0d37d90257f4d2a69d8fa
https://doi.org/10.1016/j.endm.2007.01.018
https://doi.org/10.1016/j.endm.2007.01.018