Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Glenn Hurlbert"'
Autor:
Glenn Hurlbert, Vikram Kamat
Publikováno v:
Discrete Applied Mathematics. 321:4-9
A family of sets is intersecting if every pair of its sets intersect. A star is a family with some element (a center) in each of its sets. The classical 1961 result of Erd\H{o}s, Ko, and Rado states that every intersecting family of r-sets with $r\le
Autor:
Liliana Alcón, Glenn Hurlbert
The $t$-fold pebbling number, $\pi_t(G)$, of a graph $G$ is defined to be the minimum number $m$ so that, from any given configuration of $m$ pebbles on the vertices of $G$, it is possible to place at least $t$ pebbles on any specified vertex via peb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f7a4c3c96be6ca8c13499c915f02a8a
http://arxiv.org/abs/2112.09753
http://arxiv.org/abs/2112.09753
Publikováno v:
Discrete Applied Mathematics. 266:65-75
Let ℒ = ( X , ⪯ ) be a lattice. For P ⊆ X we say that P is t -intersecting if rank ( x ∧ y ) ≥ t for all x , y ∈ P . The seminal theorem of Erdős, Ko and Rado describes the maximum intersecting P in the lattice of subsets of a finite set
Autor:
Vikram Kamat, Glenn Hurlbert
Publikováno v:
Discrete Mathematics. 341:1749-1754
A set system F is intersecting if for any F , F ′ ∈ F , F ∩ F ′ ≠ ∅ . A fundamental theorem of Erdős, Ko and Rado states that if F is an intersecting family of r -subsets of [ n ] = { 1 , … , n } , and n ≥ 2 r , then | F | ≤ n −
Autor:
László Lovász, Solomon Garfunkel, Carla D. Savage, Glenn Hurlbert, Catherine H. Yan, Henry Pollak, Fan Chung, Peter Winkler, Joel Spencer, Jaroslav Nešetřil, Donald E. Knuth, Tom Leighton, Jeffrey C. Lagarias, Steve Butler, Persi Diaconis, Andrew Odlyzko, Tim Gowers, Joe Buhler, Carl Pomerance
Publikováno v:
Notices of the American Mathematical Society. 68:1
Autor:
Franklin H. J. Kenter, Glenn Hurlbert
Publikováno v:
Notices of the American Mathematical Society. 68:1
Publikováno v:
Discrete Mathematics. 343:112121
A family of sets is intersecting if any two sets in the family intersect. Given a graph G and an integer r ≥ 1 , let I ( r ) ( G ) denote the family of independent sets of size r of G . For a vertex v of G , the family of independent sets of size r
Autor:
Glenn Hurlbert
Publikováno v:
Journal of Combinatorial Optimization. 34:343-361
Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the
Publikováno v:
Electronic Notes in Discrete Mathematics. 50:145-150
Graph pebbling is a network model for transporting discrete resources that are consumed in transit. Deciding whether a given configuration on a particular graph can reach a specified target is NP -complete, even for diameter two graphs, and deciding
Graph pebbling is a network model for transporting discrete resources that are consumed in transit. Deciding whether a given configuration on a particular graph can reach a specified target is ${\sf NP}$-complete, even for diameter two graphs, and de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5878ca608635eafe718c33c694f02cf
https://www.sciencedirect.com/science/article/pii/S0012365X17300481
https://www.sciencedirect.com/science/article/pii/S0012365X17300481