Zobrazeno 1 - 10
of 45
pro vyhledávání: '"James B. Shearer"'
Publikováno v:
SIAM Journal on Discrete Mathematics. 9:301-308
For an undirected graph and an optimal cyclic list of all its vertices, the cyclic cover time is the expected time it takes a simple random walk to travel from vertex to vertex along the list until it completes a full cycle. The main result of this p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0fe958b42ed25894a97376910e830ad
https://doi.org/10.1137/s0895480193260595
https://doi.org/10.1137/s0895480193260595
Autor:
James B. Shearer
Publikováno v:
Random Structures & Algorithms. 3:223-226
Let G be a triangle‐free graph on n points with m edges and vertex degrees d1, d2,…, dn. Let k be the maximum number of edges in a bipartite subgraph of G. In this note we show that k ⩾ m/2 + Σ **image** √di. It follows as a corollary that k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9a264badc05d548e4b5470ba40e266b
https://doi.org/10.1002/rsa.3240030211
https://doi.org/10.1002/rsa.3240030211
Autor:
James B. Shearer
Publikováno v:
Journal of Combinatorial Theory, Series B. 53(2):300-307
Let G be a triangle-free graph on n points with degree sequence d1, …, dn. Let α be the independence number of G. Let f(0) = 1, f(d) = [1 + (d2 − d) f(d − 1)](d2 + 1)d ≥ 1. We prove α ≥ Σi = 1n f(di). We also show slightly stronger resul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::365998418a7361f03c3276c23dd83599
Publikováno v:
IEEE Transactions on Information Theory, 36(6), 1334-1380. Institute of Electrical and Electronics Engineers
A table of binary constant weight codes of length n⩽28 is presented. Explicit constructions are given for most of the 600 codes in the table; the majority of these codes are new. The known techniques for constructing constant weight codes are sur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff1b2039ef82950ecf2c3bd93d194e38
https://doi.org/10.1109/18.59932
https://doi.org/10.1109/18.59932
Autor:
James B. Shearer
Publikováno v:
IEEE Transactions on Information Theory. 44:3151-3153
Let a Golomb ruler be a set {a/sub i/} of integers so that all the differences a/sub i/-a/sub j/, i/spl ne/j, are distinct. Let H(I.J) be the smallest n such that there are I disjoint Golomb rulers each containing J elements chosen from {1,2,...n}. I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15a33dac9a7ab67f62fd458b8771cebd
https://doi.org/10.1109/18.737546
https://doi.org/10.1109/18.737546
Autor:
James B. Shearer
Publikováno v:
Random Structures & Algorithms. 7:269-271
Let G be a regular graph of degree d on n points which contains no Kr (r ≥ 4). Let α be the independence number of G. Then we show for large d that α ≥ c(r)n ***image***. © 1995 John Wiley & Sons, Inc.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da555b05e0854abf835d7ebf370e0835
https://doi.org/10.1002/rsa.3240070305
https://doi.org/10.1002/rsa.3240070305
Autor:
James B. Shearer
Publikováno v:
The Electronic Journal of Combinatorics. 6
In 1991 Lorentzen and Nilsen showed how to use linear programming to prove lower bounds on the size of difference triangle sets. In this note we show how to improve these bounds by including additional valid linear inequalities in the LP formulation.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb478aa304c336ddfeef5f906b9f0fa2
https://doi.org/10.37236/1463
https://doi.org/10.37236/1463
Autor:
Don Coppersmith, James B. Shearer
Publikováno v:
The Electronic Journal of Combinatorics. 5
Following Frankl and Füredi we say a family, $F$, of subsets of an $n$-set is weakly union-free if $F$ does not contain four distinct sets $A$, $B$, $C$, $D$ with $A \cup B = C \cup D$. If in addition $A \cup B = A \cup C$ implies $B=C$ we say $F$ i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::715f1a9dc979b3c1a6a080ee860279a9
https://doi.org/10.37236/1377
https://doi.org/10.37236/1377
Publikováno v:
The Electronic Journal of Combinatorics. 4
The 1935 result of Erdos and Szekeres that any sequence of at least $n^{2}+1$ real numbers contains a monotonic subsequence of at least $n+1$ terms has stimulated extensive furher research, including a paper of J.B.Kruskal that defined an extension o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f7d85928059d6c775f1afae55753004
https://doi.org/10.37236/1329
https://doi.org/10.37236/1329
Autor:
James B. Shearer
Publikováno v:
The Electronic Journal of Combinatorics. 3
Following [2], we say a family, $H$, of subsets of a $n$-element set is cancellative if $A \cup B = A \cup C$ implies $B =C$ when $A, B, C \in H$. We show how to construct cancellative families of sets with $c 2^{.54797n}$ elements. This improves the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8275a60b475f986657d67afea21397a3
https://doi.org/10.37236/1239
https://doi.org/10.37236/1239