Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Adriana Hansberg"'
Publikováno v:
The Electronic Journal of Combinatorics. 30
Given a graph $G$, a 2-coloring of the edges of $K_n$ is said to contain a balanced copy of $G$ if we can find a copy of $G$ such that half of its edges is in each color class. If there exists an integer $k$ such that, for $n$ sufficiently large, eve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d36584a4eb334ef1b24afc3f0166cfb
https://doi.org/10.37236/10032
https://doi.org/10.37236/10032
Publikováno v:
Graphs and Combinatorics. 35:855-865
We prove the following results solving a problem raised by Caro and Yuster (Graphs Comb 32:49–63, 2016). For a positive integer $$m\ge 2$$ , $$m\ne 4$$ , there are infinitely many values of n such that the following holds: There is a weighting func
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c02efdbb0cf271cd8b38bfebec22495
https://doi.org/10.1007/s00373-019-02040-3
https://doi.org/10.1007/s00373-019-02040-3
Global amoebas are a wide and rich family of graphs that emerged from the study of certain Ramsey-Tur\'an problems in $2$-colorings of the edges of the complete graph $K_n$ that deal with the appearance of unavoidable patterns once a certain amount o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51e51154bf6b8dc5ddb9b489848d7543
Autor:
Adriana Hansberg, Lutz Volkmann
Publikováno v:
Topics in Domination in Graphs ISBN: 9783030511166
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31837eb51ec57eef47d6266d8f50042f
https://doi.org/10.1007/978-3-030-51117-3_6
https://doi.org/10.1007/978-3-030-51117-3_6
We consider $2$-colourings $f : E(G) \rightarrow \{ -1 ,1 \}$ of the edges of a graph $G$ with colours $-1$ and $1$ in $\mathbb{Z}$. A subgraph $H$ of $G$ is said to be a zero-sum subgraph of $G$ under $f$ if $f(H) := \sum_{e\in E(H)} f(e) =0$. We st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c27a49006181e3476717b0ba942b1e55
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2019, 342 (11), pp.3142-3159. ⟨10.1016/j.disc.2019.06.023⟩
Discrete Mathematics, 2019, 342 (11), pp.3142-3159. ⟨10.1016/j.disc.2019.06.023⟩
Discrete Mathematics, Elsevier, 2019, 342 (11), pp.3142-3159. ⟨10.1016/j.disc.2019.06.023⟩
Discrete Mathematics, 2019, 342 (11), pp.3142-3159. ⟨10.1016/j.disc.2019.06.023⟩
A graph is diameter-2-critical if its diameter is 2 but the removal of any edge increases the diameter. A well-studied conjecture, known as the Murty–Simon conjecture, states that any diameter-2-critical graph of order n has at most ⌊ n 2 ∕ 4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e46dcbbb245e57bb9f5b76e57cd54df4
https://hal.archives-ouvertes.fr/hal-01959683
https://hal.archives-ouvertes.fr/hal-01959683
We consider unavoidable chromatic patterns in $2$-colorings of the edges of the complete graph. Several such problems are explored being a junction point between Ramsey theory, extremal graph theory (Tur\'an type problems), zero-sum Ramsey theory, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0ecad133dab8a088025f173de429a37
http://arxiv.org/abs/1810.12375
http://arxiv.org/abs/1810.12375
Publikováno v:
Filomat. 30:2795-2801
For a graph $G$ a subset $D$ of the vertex set of $G$ is a {\it $k$-dominating set} if every vertex not in $D$ has at least $k$ neighbors in $D$. The {\it $k$-domination number} $\gamma_k(G)$ is the minimum cardinality among the $k$-dominating sets o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41d1d9898f53469f7fcd63bfaae65b3c
https://doi.org/10.2298/fil1610795h
https://doi.org/10.2298/fil1610795h
Autor:
Yair Caro, Adriana Hansberg
Publikováno v:
Electronic Notes in Discrete Mathematics. 50:465-470
Let G be a graph and F a family of graphs. We say a subset S of the vertices of G to be F -isolating if the graph induced by the vertices outside S that have no neighbors in S contains no member of F as a subgraph. The F -isolation number ι ( G , F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be4bd1466f39daf214716e48c73ffda8
https://doi.org/10.1016/j.endm.2015.07.077
https://doi.org/10.1016/j.endm.2015.07.077
Publikováno v:
Graphs and Combinatorics. 31:1163-1176
A graph $$G$$G is diameter-2-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter-2-critical graph $$G$$G of order $$n$$n is at most $$\lfloor n^2/4 \r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b514528bfca50f88bb8df35851f1bea
https://doi.org/10.1007/s00373-014-1469-2
https://doi.org/10.1007/s00373-014-1469-2