Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Kevin G. Milans"'
Publikováno v:
Graphs and Combinatorics. 38
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97dd1ad4bd9b1b14259b1eb1e3b7c072
https://doi.org/10.1007/s00373-021-02417-3
https://doi.org/10.1007/s00373-021-02417-3
Publikováno v:
James A. Long, J, Milans, K G & Munaro, A 2021, ' Sublinear Longest Path Transversals ', SIAM Journal on Discrete Mathematics, vol. 35, no. 3, pp. 1673–1677 . https://doi.org/10.1137/20M1362577
We show that connected graphs admit sublinear longest path transversals. This improves an earlier result of Rautenbach and Sereni and is related to the fifty-year-old question of whether connected graphs admit longest path transversals of constant si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e78f7bfd8272fa51da2f68bf6a3e163
https://pure.qub.ac.uk/en/publications/sublinear-longest-path-transversals(b855d714-4809-4ead-997e-a541fe514240).html
https://pure.qub.ac.uk/en/publications/sublinear-longest-path-transversals(b855d714-4809-4ead-997e-a541fe514240).html
Publikováno v:
Graphs and Combinatorics. 35:91-102
A 2-ranking of a graph G is an ordered partition of the vertices of G into independent sets $$V_1, \ldots , V_t$$ such that for $$i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36ccd3c852036527f95bd95bbfb62df1
https://doi.org/10.1007/s00373-018-1979-4
https://doi.org/10.1007/s00373-018-1979-4
Autor:
Michael C. Wigal, Kevin G. Milans
First-Fit is a greedy algorithm for partitioning the elements of a poset into chains. Let $\textrm{FF}(w,Q)$ be the maximum number of chains that First-Fit uses on a $Q$-free poset of width $w$. A result due to Bosek, Krawczyk, and Matecki states tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd9c1a762494164c21c588dcd738514a
Publikováno v:
Journal of Combinatorial Theory, Series A. 136:174-183
Let $2^{[n]}$ denote the power set of $[n]:=\{1,2,..., n\}$. A collection $\B\subset 2^{[n]}$ forms a $d$-dimensional {\em Boolean algebra} if there exist pairwise disjoint sets $X_0, X_1,..., X_d \subseteq [n]$, all non-empty with perhaps the except
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c32f1b5d01bd6bb4546e7fc6d63f927
https://doi.org/10.1016/j.jcta.2015.06.004
https://doi.org/10.1016/j.jcta.2015.06.004
Publikováno v:
Journal of Combinatorics. 6:445-456
We introduce an ordered version of Ramsey numbers for hypergraphs using linearly ordered vertex sets. In this model, we obtain bounds on the ordered Ramsey numbers of the k-uniform hypergraph whose edge set consists of the sets of k consecutive verti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca520e4525397c2b51a10a0415538ab3
https://doi.org/10.4310/joc.2015.v6.n4.a3
https://doi.org/10.4310/joc.2015.v6.n4.a3
Autor:
Kevin G. Milans, Michael C. Wigal
We study a combinatorial coloring game between two players, Spoiler and Algorithm, who alternate turns. First, Spoiler places a new token at a vertex in $G$, and Algorithm responds by assigning a color to the new token. Algorithm must ensure that tok
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4258c44a80a66e084676bd0d4b15259
Publikováno v:
European Journal of Combinatorics. 34:414-423
Let H->sG mean that every s-coloring of E(H) produces a monochromatic copy of G in some color class. Let the s-color degree Ramsey number of a graph G, written R"@D(G;s), be min{@D(H):H->sG}. We prove that the 2-color degree Ramsey number is at most
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44a4457059fe18cf3bae49525095a735
https://doi.org/10.1016/j.ejc.2012.08.004
https://doi.org/10.1016/j.ejc.2012.08.004
Publikováno v:
Journal of Combinatorial Theory, Series B. 102(4):869-874
We prove that every Hamiltonian graph with n vertices and m edges has cycles with more than p−12lnp−1 different lengths, where p=m−n. For general m and n, there exist such graphs having at most 2⌈p+1⌉ different cycle lengths.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98dad3e64a5b467971e3a702f2ebb821
Publikováno v:
Journal of Graph Theory. 71:416-434
For a family of graphs, a graph G is -saturated if G contains no member of as a subgraph, but for any edge in , contains some member of as a subgraph. The minimum number of edges in an -saturated graph of order n is denoted *. A subdivision of a grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8e28271b5fe1daf0b9fac596df7c2a4
https://doi.org/10.1002/jgt.21625
https://doi.org/10.1002/jgt.21625