Zobrazeno 1 - 10
of 28
pro vyhledávání: '"John L. Goldwasser"'
Publikováno v:
Discrete Applied Mathematics. 266:103-110
Two sets are weakly incomparable if neither properly contains the other; they are strongly incomparable if they are unequal and neither contains the other. Two families A and B of sets are weakly (or strongly) incomparable if no set in one of A and B
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2e7887430952a56db47088f8e332ff8
https://doi.org/10.1016/j.dam.2019.05.007
https://doi.org/10.1016/j.dam.2019.05.007
Autor:
Ryan Hansen, John L. Goldwasser
Publikováno v:
Discrete Mathematics. 344:112585
Let H and K be subsets of the vertex set V ( Q d ) of the d-cube Q d (we call H and K configurations in Q d ). We say K is an exact copy of H if there is an automorphism of Q d which sends H to K. If d is a positive integer and H is a configuration i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52eb098be04f42483f746259b396453a
https://doi.org/10.1016/j.disc.2021.112585
https://doi.org/10.1016/j.disc.2021.112585
Publikováno v:
The Electronic Journal of Linear Algebra. 32:464-474
The game LIGHTS OUT! is played on a 5 by 5 square grid of buttons; each button may be on or off. Pressing a button changes the on/o state of the light of the button pressed and of all its vertical and horizontal neighbors. Given an initial configurat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1ec03dcc7b13b7e9e29f3b659310c08
https://doi.org/10.13001/1081-3810.3483
https://doi.org/10.13001/1081-3810.3483
Publikováno v:
Journal of Combinatorial Theory, Series A. 130:26-41
We generalize a theorem of M. Hall Jr., that an r × n Latin rectangle on n symbols can be extended to an n × n Latin square on the same n symbols. Let p, n, ? 1 , ? 2 , ? , ? n be positive integers such that 1 ? ? i ? p ( 1 ? i ? n ) and ? i = 1 n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dccccd2e6f5d0bd78d32c1cc02a62134
https://doi.org/10.1016/j.jcta.2014.10.007
https://doi.org/10.1016/j.jcta.2014.10.007
Autor:
Ryan Hansen, John L. Goldwasser
Publikováno v:
SIAM Journal on Discrete Mathematics. 27:910-917
If $H$ is a 3-graph, then ${\rm ex}(n;H)$ denotes the maximum number of edges in a 3-graph on $n$ vertices containing no sub-3-graph isomorphic to $H$. Let $S(n)$ denote the 3-graph on $n$ vertices obtained by partitioning the vertex set into parts o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e53c9a8116ab4285bf3d15b924e1939
https://doi.org/10.1137/110841837
https://doi.org/10.1137/110841837
Autor:
Bernard Lidický, Ryan Martin, John Talbot, Michael Young, Ryan Hansen, John L. Goldwasser, David Offner, Maria Axenovich
If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polychromatic number of G, denoted poly_H(G), is the largest number of color
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c8e8014c0acb6b1083e09c316ed54c3
http://arxiv.org/abs/1612.03298
http://arxiv.org/abs/1612.03298
Autor:
John L. Goldwasser, David Offner, Ryan R. Martin, Michael Young, John Talbot, Bernard Lidický
Given a subgraph G of the hypercube Q_n, a coloring of the edges of Q_n such that every embedding of G contains an edge of every color is called a G-polychromatic coloring. The maximum number of colors with which it is possible to G-polychromatically
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cdf99774a5ac74f9243e41a73b0ec53f
http://arxiv.org/abs/1603.05865
http://arxiv.org/abs/1603.05865
Publikováno v:
Journal of Combinatorial Designs. 19:268-279
In 1974 Cruse gave necessary and sufficient conditions for an r × s partial latin square P on symbols σ1,σ2,…,σt, which may have some unfilled cells, to be completable to an n × n latin square on symbols σ1,σ2,…,σn, subject to the conditi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7f6cff32e384196f99496a9d2216a08
https://doi.org/10.1002/jcd.20273
https://doi.org/10.1002/jcd.20273
Publikováno v:
Graphs and Combinatorics. 25:309-326
Let G be a graph in which each vertex can be in one of two states: on or off. In the σ-game, when you “push” a vertex v you change the state of all of its neighbors, while in the σ+-game you change the state of v as well. Given a starting confi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7efbe31e42bd2eb2f06c79e92017dab4
https://doi.org/10.1007/s00373-009-0841-0
https://doi.org/10.1007/s00373-009-0841-0
Publikováno v:
European Journal of Combinatorics. 30:774-787
Each vertex in a simple graph is in one of two states: "on" or "off". The set of all on vertices is called a configuration. In the σ-game, "pushing" a vertex v changes the state of all vertices in the open neighborhood of v, while in the σ+-game pu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f96b9086384dd534ceb0743900d3e753
https://doi.org/10.1016/j.ejc.2008.09.020
https://doi.org/10.1016/j.ejc.2008.09.020