Search

Your search keyword '"Cho, Eun Kyung"' showing total 709 results
Start Over Author "Cho, Eun Kyung"
709 results on '"Cho, Eun Kyung"'

1. The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs

Author

Anderson, James, Chau, Herman, Cho, Eun-Kyung, Crawford, Nicholas, Hartke, Stephen G., Heath, Emily, Henderschedt, Owen, Kwon, Hyemin, and Zhang, Zhiyuan

Subjects
Mathematics - Combinatorics
Abstract

We introduce a new tool useful for greedy coloring, which we call the forb-flex method, and apply it to odd coloring and proper conflict-free coloring of planar graphs. The odd chromatic number, denoted $\chi_{\mathsf{o}}(G)$, is the smallest number of colors needed to properly color $G$ such that every non-isolated vertex of $G$ has a color appearing an odd number of times in its neighborhood. The proper conflict-free chromatic number, denoted $\chi_{\mathsf{PCF}}(G)$, is the smallest number of colors needed to properly color $G$ such that every non-isolated vertex of $G$ has a color appearing uniquely in its neighborhood. Our new tool works by carefully counting the structures in the neighborhood of a vertex and determining if a neighbor of a vertex can be recolored at the end of a greedy coloring process to avoid conflicts. Combining this with the discharging method allows us to prove $\chi_{\mathsf{PCF}}(G) \leq 4$ for planar graphs of girth at least 11, and $\chi_{\mathsf{o}}(G) \leq 4$ for planar graphs of girth at least 10. These results improve upon the recent works of Cho, Choi, Kwon, and Park., Comment: 32 pages, 11 figures

Published
2024

2. On the interval coloring impropriety of graphs

Author

Carr, MacKenzie, Cho, Eun-Kyung, Crawford, Nicholas, Iršič, Vesna, Pai, Leilani, and Robinson, Rebecca

Subjects
Mathematics - Combinatorics, 05C15
Abstract

An improper interval (edge) coloring of a graph $G$ is an assignment of colors to the edges of $G$ satisfying the condition that, for every vertex $v \in V(G)$, the set of colors assigned to the edges incident with $v$ forms an integral interval. An interval coloring is $k$-improper if at most $k$ edges with the same color all share a common endpoint. The minimum integer $k$ such that there exists a $k$-improper interval coloring of the graph $G$ is the interval coloring impropriety of $G$, denoted by $\mu_{int}(G)$. In this paper, we provide a construction of an interval coloring of a subclass of complete multipartite graphs. This provides additional evidence to the conjecture by Casselgren and Petrosyan that $\mu_{int}(G)\leq 2$ for all complete multipartite graphs $G$. Additionally, we determine improved upper bounds on the interval coloring impropriety of several classes of graphs, namely 2-trees, iterated triangulations, and outerplanar graphs. Finally, we investigate the interval coloring impropriety of the corona product of two graphs, $G\odot H$., Comment: 17 pages, 8 figures, 7 tables

Published
2023

3. Domination of subcubic planar graphs with large girth

Author

Cho, Eun-Kyung, Culver, Eric, Hartke, Stephen G., and Iršič, Vesna

Subjects
Mathematics - Combinatorics
Abstract

Since Reed conjectured in 1996 that the domination number of a connected cubic graph of order $n$ is at most $\lceil \frac13 n \rceil$, the domination number of cubic graphs has been extensively studied. It is now known that the conjecture is false in general, but Henning and Dorbec showed that it holds for graphs with girth at least $9$. Zhu and Wu stated an analogous conjecture for 2-connected cubic planar graphs. In this paper, we present a new upper bound for the domination number of subcubic planar graphs: if $G$ is a subcubic planar graph with girth at least 8, then $\gamma(G) < n_0 + \frac{3}{4} n_1 + \frac{11}{20} n_2 + \frac{7}{20} n_3$, where $n_i$ denotes the number of vertices in $G$ of degree $i$, for $i \in \{0,1,2,3\}$. We also prove that if $G$ is a subcubic planar graph with girth at least 9, then $\gamma(G) < n_0 + \frac{13}{17} n_1 + \frac{9}{17} n_2 + \frac{6}{17} n_3$., Comment: 26 pages, 35 figures

Published
2023

5. Independent domination versus packing in subcubic graphs

Author

Cho, Eun-Kyung and Kim, Minki

Subjects
Mathematics - Combinatorics
Abstract

In 2011, Henning, L\"{o}wenstein, and Rautenbach observed that the domination number of a graph is bounded from above by the product of the packing number and the maximum degree of the graph. We prove a stronger statement in subcubic graphs: the independent domination number is bounded from above by three times the packing number., Comment: 9 pages, 3 figures

Published
2023

7. Amivantamab plus lazertinib in osimertinib-relapsed EGFR-mutant advanced non-small cell lung cancer: a phase 1 trial

Author

Cho, Byoung Chul, Kim, Dong-Wan, Spira, Alexander I, Gomez, Jorge E, Haura, Eric B, Kim, Sang-We, Sanborn, Rachel E, Cho, Eun Kyung, Lee, Ki Hyeong, Minchom, Anna, Lee, Jong-Seok, Han, Ji-Youn, Nagasaka, Misako, Sabari, Joshua K, Ou, Sai-Hong Ignatius, Lorenzini, Patricia, Bauml, Joshua M, Curtin, Joshua C, Roshak, Amy, Gao, Grace, Xie, John, Thayu, Meena, Knoblauch, Roland E, and Park, Keunchil

Subjects
Biomedical and Clinical Sciences, Clinical Sciences, Oncology and Carcinogenesis, Cancer, Clinical Trials and Supportive Activities, Lung, Lung Cancer, Clinical Research, Evaluation of treatments and therapeutic interventions, 6.1 Pharmaceuticals, 6.2 Cellular and gene therapies, Humans, Carcinoma, Non-Small-Cell Lung, Lung Neoplasms, Prospective Studies, Protein Kinase Inhibitors, Mutation, Aniline Compounds, ErbB Receptors, Medical and Health Sciences, Immunology, Biomedical and clinical sciences, Health sciences
Abstract

Patients with epidermal growth factor receptor (EGFR)-mutated non-small cell lung cancer (NSCLC) often develop resistance to current standard third-generation EGFR tyrosine kinase inhibitors (TKIs); no targeted treatments are approved in the osimertinib-relapsed setting. In this open-label, dose-escalation and dose-expansion phase 1 trial, the potential for improved anti-tumor activity by combining amivantamab, an EGFR-MET bispecific antibody, with lazertinib, a third-generation EGFR TKI, was evaluated in patients with EGFR-mutant NSCLC whose disease progressed on third-generation TKI monotherapy but were chemotherapy naive (CHRYSALIS cohort E). In the dose-escalation phase, the recommended phase 2 combination dose was established; in the dose-expansion phase, the primary endpoints were safety and overall response rate, and key secondary endpoints included progression-free survival and overall survival. The safety profile of amivantamab and lazertinib was generally consistent with previous experience of each agent alone, with 4% experiencing grade ≥3 events; no new safety signals were identified. In an exploratory cohort of 45 patients who were enrolled without biomarker selection, the primary endpoint of investigator-assessed overall response rate was 36% (95% confidence interval, 22-51). The median duration of response was 9.6 months, and the median progression-free survival was 4.9 months. Next-generation sequencing and immunohistochemistry analyses identified high EGFR and/or MET expression as potential predictive biomarkers of response, which will need to be validated with prospective assessment. ClinicalTrials.gov identifier: NCT02609776 .

Published
2023

8. Brooks-type theorems for relaxations of square colorings

Author

Cho, Eun-Kyung, Choi, Ilkyoo, Kwon, Hyemin, and Park, Boram

Subjects
Mathematics - Combinatorics
Abstract

The following relaxation of proper coloring the square of a graph was recently introduced: for a positive integer $h$, the proper $h$-conflict-free chromatic number of a graph $G$, denoted $\chi_{pcf}^h(G)$, is the minimum $k$ such that $G$ has a proper $k$-coloring where every vertex $v$ has $\min\{deg_G(v),h\}$ colors appearing exactly once on its neighborhood. Caro, Petru\v{s}evski, and \v{S}krekovski put forth a Brooks-type conjecture: if $G$ is a graph with $\Delta(G)\ge 3$, then $\chi_{pcf}^1(G)\leq \Delta(G)+1$. The best known result regarding the conjecture is $\chi_{pcf}^1(G)\leq 2\Delta(G)+1$, which is implied by a result of Pach and Tardos. We improve upon the aforementioned result for all $h$, and also enlarge the class of graphs for which the conjecture is known to be true. Our main result is the following: for a graph $G$, if $\Delta(G) \ge h+2$, then $\chi_{pcf}^h(G)\le (h+1)\Delta(G)-1$; this is tight up to the additive term as we explicitly construct infinitely many graphs $G$ with $\chi_{pcf}^h(G)=(h+1)(\Delta(G)-1)$. We also show that the conjecture is true for chordal graphs, and obtain partial results for quasi-line graphs and claw-free graphs. Our main result also improves upon a Brooks-type result for $h$-dynamic coloring., Comment: 20 pages, 1 figure

Published
2023

10. Relaxation of Wegner's Planar Graph Conjecture for maximum degree 4

Author

Cho, Eun-Kyung, Choi, Ilkyoo, and Lidický, Bernard

Subjects
Mathematics - Combinatorics
Abstract

The famous Wegner's Planar Graph Conjecture asserts tight upper bounds on the chromatic number of the square $G^2$ of a planar graph $G$, depending on the maximum degree $\Delta(G)$ of $G$. The only case that the conjecture is resolved is when $\Delta(G)=3$, which was proven to be true by Thomassen, and independently by Hartke, Jahanbekam, and Thomas. For $\Delta(G)=4$, Wegner's Planar Graph Conjecture states that the chromatic number of $G^2$ is at most 9; even this case is still widely open, and very recently Bousquet, de Meyer, Deschamps, and Pierron claimed an upper bound of 12. We take a completely different approach, and show that a relaxation of properly coloring the square of a planar graph $G$ with $\Delta(G)=4$ can be achieved with 9 colors. Instead of requiring every color in the neighborhood of a vertex to be unique, which is equivalent to a proper coloring of $G^2$, we seek a proper coloring of $G$ such that at most one color is allowed to be repeated in the neighborhood of a vertex of degree 4, but nowhere else., Comment: 9 pages

Published
2022

11. Phase III KEYNOTE-789 Study of Pemetrexed and Platinum With or Without Pembrolizumab for Tyrosine Kinase Inhibitor[FIGURE DASH]Resistant, EGFR–Mutant, Metastatic Nonsquamous Non–Small Cell Lung Cancer

Author

Yang, James Chih-Hsin, Lee, Dae Ho, Lee, Jong-Seok, Fan, Yun, de Marinis, Filippo, Iwama, Eiji, Inoue, Takako, Rodríguez-Cid, Jerónimo, Zhang, Li, Yang, Cheng-Ta, de la Mora Jimenez, Emmanuel, Zhou, Jianying, Pérol, Maurice, Lee, Ki Hyeong, Vicente, David, Ichihara, Eiki, Riely, Gregory J., Luo, Yiwen, Chirovsky, Diana, Pietanza, M. Catherine, Bhagwati, Niyati, Lu, Shun, Joseph Boyer, Michael, Hui, Rina, Wong, Mark, Mant, Andrew, Parente, Phillip, John, Thomas, Parakh, Sagun, Castro, Gilberto, Jr, Werutsky, Gustavo, de Azevedo, Sergio Jobim, Andre Franke, Fabio, De Almeida Rego, Joilda Batista, Martins De Marchi, Pedro Rafael, Dix Junqueira, Gustavo, Maris Peria, Fernanda, Brust, Leandro, Cheema, Parneet, Doherty, Mark, Parmar, Ambika, Menjak, Ines B., Leighl, Natasha B., Agulnik, Jason, Lu, Shun, Han, Zhigang, Cui, Jiuwei, Zhang, Li, Cheng, Ying, Chen, Gongyan, Zhang, Helong, Yao, Yu, Hu, Chengping, Wang, Qiming, Zhang, Xin, Zhang, Yong, Zhou, Jianying, Ying, Kejing, Fan, Yun, Wang, Yan, Wang, Ziping, Feng, Jifeng, Du, YingYing, Wu, Lin, Huang, Cheng, Zhou, Xiangdong, Perol, Maurice, Domont, Julien, Lamour, Corinne, Dutilh, Julien, Oulkhouir, Youssef, Westeel, Virginie, Carmier, Delphine, Coudert, Bruno, Lagrange, Aurelie, Spaeth, Dominique, Ropert, Stanislas, Christoph, Daniel C., Kern, Jens, Kopp, Hans-Georg, Griesinger, Frank, Wiewrodt, Rainer, Wermke, Martin, Wesseler, Claas, Mueller, Annette, Vogel, Gunther, Lee, Victor, James Ho, Chung Man, Oscar Chan, Siu Hong, Hung Lo, Sing, Jonathan Nyaw, Shi Feng, Jacky Li, Yu Chung, Bar, Jair, Gottfried, Maya, Dudnik, Julia, Zer, Alona, Moskovitz, Mor, Wollner, Mirjana, Rotem, Ofer, Shamai, Sivan, Asna, Noam, Kamel, Mhameed, Novello, Silvia, Di Costanzo, Francesco, Doni, Laura, Mazzoni, Francesca, Ferrau, Francesco, de Marinis, Filippo, Tonini, Giuseppe, Galetta, Domenico, Piantedosi, Francovito, Vitiello, Fabiana, Kirita, Keisuke, Yoh, Kiyotaka, Takahashi, Toshiaki, Ohe, Yuichiro, Hattori, Yoshihiro, Okamoto, Isamu, Kurata, Takayasu, Yoshioka, Hiroshige, Saka, Hideo, Oki, Masahide, Kato, Terufumi, Tanaka, Hiroshi, Kumagai, Toru, Inoue, Takako, Hida, Toyoaki, Horio, Yoshitsugu, Teraoka, Shunsuke, Ichihara, Eiki, Kishi, Kazuma, Takaya, Hisashi, Takai, Daiya, Kozuki, Toshiyuki, Kasahara, Kazuo, Tambo, Yuichi, Hosomi, Yukio, Kondo, Masashi, Ichiki, Masao, Takeoka, Hiroaki, de la Mora Jimenez, Emmanuel, Hernandez, Carlos Alberto, Rodriguez Cid, Jeronimo Rafael, Rodriguez, Oscar Gerardo Arrieta, Han, Ji-Youn, Min, Young Joo, Kim, Dong-Wan, Park, Keunchil, Lee, Se-Hoon, Lee, Ki Hyeong, Lee, Jong-Seok, Kang, Jin Hyoung, Lee, Dae Ho, Cho, Eun Kyung, Carcereny, Enric, Lopez, Pilar Garrido, Tarruella, Margarita Majem, Rodriguez, Luis Paz-Ares, Vicente Baz, David, Font, Enriqueta Felip, Cobo-Dols, Manuel, Ekman, Simon, Bergman, Bengt, Ohman, Ronny, Vikstrom, Anders, Yang, Chih-Hsin, Chiu, Chao-Hua, Huang, Hsu-Ching, Yang, Cheng-Ta, Su, Jian, Chang, Gee-Chen, Yang, Tsung-Ying, Hsia, Te-Chun, Su, Wu-Chou, Wu, Shang-Yin, Wang, Chin-Chou, Lee, Kang-Yun, Lin, Sheng-Hao, Lin, Chih-Bin, Lee, Jih-Hsiang, Huang, Chun-Yao, Ahmed, Samreen, Newsom-Davis, Thomas, Baijal, Shobhit, Brock, Juliet, Zaki, Kam, Shamash, Jonathan, Papadatos-Pastos, Dionysis, Jain, Pooja, Jane Mackean, Melanie, Kendall, Stephan DiSean, Anderson, Ian, Costin, Dan, Hall, Richard, Campbell, Nicholas, Khan, Saad, Dowell, Jonathan, Mashru, Sandeep, Menon, Smitha, Raza, Ahmad, Ge, Li, Riely, Gregory J., Seetharamu, Nagashree, Stampleman, Laura, Subramanian, Janakiraman, Wender, Donald B., Natale, Ronald B., Zhu, Viola, Ignatius Ou, Sai-Hong, Sanborn, Rachel, and Evangelist, Makenzi C.

Published
2024
Full Text
View/download PDF

15. Proper conflict-free coloring of sparse graphs

Author

Cho, Eun-Kyung, Choi, Ilkyoo, Kwon, Hyemin, and Park, Boram

Subjects
Mathematics - Combinatorics
Abstract

A {\it proper conflict-free $c$-coloring} of a graph is a proper $c$-coloring such that each non-isolated vertex has a color appearing exactly once on its neighborhood. This notion was formally introduced by Fabrici et al., who proved that planar graphs have a proper conflict-free 8-coloring and constructed a planar graph with no proper conflict-free 5-coloring. Caro, Petru\v{s}evski, and \v{S}krekovski investigated this coloring concept further, and in particular studied upper bounds on the maximum average degree that guarantees a proper conflict-free $c$-coloring for $c\in\{4,5,6\}$. Along these lines, we completely determine the threshold on the maximum average degree of a graph $G$, denoted $mad(G)$, that guarantees a proper conflict-free $c$-coloring for all $c$ and also provide tightness examples. Namely, for $c\geq 5$ we prove that a graph $G$ with $mad(G)\leq \frac{4c}{c+2}$ has a proper conflict-free $c$-coloring, unless $G$ contains a $1$-subdivision of the complete graph on $c+1$ vertices. When $c=4$, we show that a graph $G$ with $mad(G)<\frac{12}{5}$ has a proper conflict-free $4$-coloring, unless $G$ contains an induced $5$-cycle. In addition, we show that a planar graph with girth at least 5 has a proper conflict-free $7$-coloring., Comment: 15 pages, 2 figures

Published
2022

16. Odd coloring of sparse graphs and planar graphs

Author

Cho, Eun-Kyung, Choi, Ilkyoo, Kwon, Hyemin, and Park, Boram

Subjects
Mathematics - Combinatorics
Abstract

An {\it odd $c$-coloring} of a graph is a proper $c$-coloring such that each non-isolated vertex has a color appearing an odd number of times on its neighborhood. This concept was introduced very recently by Petru\v sevski and \v Skrekovski and has attracted considerable attention. Cranston investigated odd colorings of graphs with bounded maximum average degree, and conjectured that every graph $G$ with $mad(G)\leq \frac{4c-4}{c+1}$ has an odd $c$-coloring for $c\geq 4$, and proved the conjecture for $c\in\{5, 6\}$. In particular, planar graphs with girth at least $7$ and $6$ have an odd $5$-coloring and an odd $6$-coloring, respectively. We completely resolve Cranston's conjecture. For $c\geq 7$, we show that the conjecture is true, in a stronger form that was implicitly suggested by Cranston, but for $c=4$, we construct counterexamples, which all contain $5$-cycles. On the other hand, we show that a graph $G$ with $mad(G)<\frac{22}{9}$ and no induced $5$-cycles has an odd $4$-coloring. This implies that a planar graph with girth at least 11 has an odd $4$-coloring. We also prove that a planar graph with girth at least 5 has an odd $6$-coloring., Comment: 12 pages

Published
2022

17. Independent domination of graphs with bounded maximum degree

Author

Cho, Eun-Kyung, Kim, Jinha, Kim, Minki, and Oum, Sang-il

Subjects
Mathematics - Combinatorics
Abstract

An independent dominating set of a graph, also known as a maximal independent set, is a set $S$ of pairwise non-adjacent vertices such that every vertex not in $S$ is adjacent to some vertex in $S$. We prove that for $\Delta=4$ or $\Delta\ge 6$, every connected $n$-vertex graph of maximum degree at most $\Delta$ has an independent dominating set of size at most $(1-\frac{\Delta}{\lfloor\Delta^2/4\rfloor+\Delta})(n-1)+1$. In addition, we characterize all connected graphs having the equality and we show that other connected graphs have an independent dominating set of size at most $(1-\frac{\Delta}{ \lfloor\Delta^2/4\rfloor+\Delta})n$., Comment: 14 pages

Published
2022
Full Text
View/download PDF

18. Tight bound for independent domination of cubic graphs without $4$-cycles

Author

Cho, Eun-Kyung, Choi, Ilkyoo, Kwon, Hyemin, and Park, Boram

Subjects
Mathematics - Combinatorics, 05C69
Abstract

Given a graph $G$, a dominating set of $G$ is a set $S$ of vertices such that each vertex not in $S$ has a neighbor in $S$. The domination number of $G$, denoted $\gamma(G)$, is the minimum size of a dominating set of $G$. The independent domination number of $G$, denoted $i(G)$, is the minimum size of a dominating set of $G$ that is also independent. Recently, Abrishami and Henning proved that if $G$ is a cubic graph with girth at least $6$, then $i(G) \le \frac{4}{11}|V(G)|$. We show a result that not only improves upon the upper bound of the aforementioned result, but also applies to a larger class of graphs, and is also tight. Namely, we prove that if $G$ is a cubic graph without $4$-cycles, then $i(G) \le \frac{5}{14}|V(G)|$, which is tight. Our result also implies that every cubic graph $G$ without $4$-cycles satisfies $\frac{i(G)}{\gamma(G)} \le \frac{5}{4}$, which partially answers a question by O and West in the affirmative., Comment: 16 pages, 4 figures

Published
2021
Full Text
View/download PDF

19. On independent domination of regular graphs

Author

Cho, Eun-Kyung, Choi, Ilkyoo, and Park, Boram

Subjects
Mathematics - Combinatorics, 05C69
Abstract

Given a graph $G$, a dominating set of $G$ is a set $S$ of vertices such that each vertex not in $S$ has a neighbor in $S$. The domination number of $G$, denoted $\gamma(G)$, is the minimum size of a dominating set of $G$. The independent domination number of $G$, denoted $i(G)$, is the minimum size of a dominating set of $G$ that is also independent. Note that every graph has an independent dominating set, as a maximal independent set is equivalent to an independent dominating set. Let $G$ be a connected $k$-regular graph that is not $K_{k, k}$ where $k\geq 4$. Generalizing a result by Lam, Shiu, and Sun, we prove that $i(G)\le \frac{k-1}{2k-1}|V(G)|$, which is tight for $k = 4$. This answers a question by Goddard et al. in the affirmative. We also show that $\frac{i(G)}{\gamma(G)} \le \frac{k^3-3k^2+2}{2k^2-6k+2}$, strengthening upon a result of Knor, \v{S}krekovski, and Tepeh. In addition, we prove that a graph $G'$ with maximum degree at most $4$ satisfies $i(G') \le \frac{5}{9}|V(G')|$, which is also tight., Comment: 15 pages, 5 figures

Published
2021

20. Improvements on Hippchen's Conjecture

Author

Cho, Eun-Kyung, Choi, Ilkyoo, and Park, Boram

Subjects
Mathematics - Combinatorics
Abstract

Let $G$ be a $k$-connected graph on $n$ vertices. Hippchen's Conjecture states that two longest paths in $G$ share at least $k$ vertices. Guti\'errez recently proved the conjecture when $k\leq 4$ or $k\geq \frac{n-2}{3}$. We improve upon both results; namely, we show that two longest paths in $G$ share at least $k$ vertices when $k=5$ or $k\geq \frac{n+2}{5}$. This completely resolves two conjectures of Guti\'errez in the affirmative., Comment: 12 page, 6 figures

Published
2020

21. Decomposing planar graphs into graphs with degree restrictions

Author

Cho, Eun-Kyung, Choi, Ilkyoo, Kim, Ringi, Park, Boram, Shan, Tingting, and Zhu, Xuding

Subjects
Mathematics - Combinatorics
Abstract

Given a graph $G$, a decomposition of $G$ is a partition of its edges. A graph is $(d, h)$-decomposable if its edge set can be partitioned into a $d$-degenerate graph and a graph with maximum degree at most $h$. For $d \le 4$, we are interested in the minimum integer $h_d$ such that every planar graph is $(d,h_d)$-decomposable. It was known that $h_3 \le 4$, $h_2\le 8$, and $h_1 = \infty$. This paper proves that $h_4=1, h_3=2$, and $4 \le h_2 \le 6$., Comment: 16 pages, 5 figures

Published
2020

22. The strong clique number of graphs with forbidden cycles

Author

Cho, Eun-Kyung, Choi, Ilkyoo, Kim, Ringi, and Park, Boram

Subjects
Mathematics - Combinatorics, 05C35, 05C70, 05C15
Abstract

Given a graph $G$, the strong clique number of $G$, denoted $\omega_S(G)$, is the maximum size of a set $S$ of edges such that every pair of edges in $S$ has distance at most $2$ in the line graph of $G$. As a relaxation of the renowned Erd\H{o}s--Ne\v{s}et\v{r}il conjecture regarding the strong chromatic index, Faudree et al. suggested investigating the strong clique number, and conjectured a quadratic upper bound in terms of the maximum degree. Recently, Cames van Batenburg, Kang, and Pirot conjectured a linear upper bound in terms of the maximum degree for graphs without even cycles. Namely, if $G$ is a $C_{2k}$-free graph, then $\omega_S(G)\leq (2k-1)\Delta(G)-{2k-1\choose 2}$, and if $G$ is a $C_{2k}$-free bipartite graph, then $\omega_S(G)\leq k\Delta(G)-(k-1)$. We prove the second conjecture in a stronger form, by showing that forbidding all odd cycles is not necessary. To be precise, we show that a $\{C_5, C_{2k}\}$-free graph $G$ with $\Delta(G)\ge 1$ satisfies $\omega_S(G)\leq k\Delta(G)-(k-1)$, when either $k\geq 4$ or $k\in \{2,3\}$ and $G$ is also $C_3$-free. Regarding the first conjecture, we prove an upper bound that is off by the constant term. Namely, for $k\geq 3$, we prove that a $C_{2k}$-free graph $G$ with $\Delta(G)\ge 1$ satisfies $\omega_S(G)\leq (2k-1)\Delta(G)+(2k-1)^2$. This improves some results of Cames van Batenburg, Kang, and Pirot., Comment: 15 pages, 7 figures

Published
2020

23. Partitioning planar graphs without $4$-cycles and $5$-cycles into bounded degree forests

Author

Cho, Eun-Kyung, Choi, Ilkyoo, and Park, Boram

Subjects
Mathematics - Combinatorics
Abstract

In 1976, Steinberg conjectured that planar graphs without $4$-cycles and $5$-cycles are $3$-colorable. This conjecture attracted numerous researchers for about 40 years, until it was recently disproved by Cohen-Addad et al. (2017). However, coloring planar graphs with restrictions on cycle lengths is still an active area of research, and the interest in this particular graph class remains. Let $G$ be a planar graph without $4$-cycles and $5$-cycles. For integers $d_1$ and $d_2$ satisfying $d_1+d_2\geq8$ and $d_2\geq d_1\geq 2$, it is known that $V(G)$ can be partitioned into two sets $V_1$ and $V_2$, where each $V_i$ induces a graph with maximum degree at most $d_i$. Since Steinberg's Conjecture is false, a partition of $V(G)$ into two sets, where one induces an empty graph and the other induces a forest is not guaranteed. Our main theorem is at the intersection of the two aforementioned research directions. We prove that $V(G)$ can be partitioned into two sets $V_1$ and $V_2$, where $V_1$ induces a forest with maximum degree at most $3$ and $V_2$ induces a forest with maximum degree at most $4$; this is both a relaxation of Steinberg's conjecture and a strengthening of results by Sittitrai and Nakprasit (2019) in a much stronger form.

Published
2020

24. Generalized list colouring of graphs

Author

Cho, Eun-Kyung, Choi, Ilkyoo, Jiang, Yiting, Kim, Ringi, Park, Boram, Yan, Jiayan, and Zhu, Xuding

Subjects
Mathematics - Combinatorics
Abstract

This paper disproves a conjecture of Wang, Wu, Yan and Xie, and answers in negative a question in Dvorak, Pekarek and Sereni. In return, we pose five open problems., Comment: 6 pages

Published
2020

26. On induced saturation for paths

Author

Cho, Eun-Kyung, Choi, Ilkyoo, and Park, Boram

Subjects
Mathematics - Combinatorics
Abstract

For a graph $H$, a graph $G$ is $H$-induced-saturated if $G$ does not contain an induced copy of $H$, but either removing an edge from $G$ or adding a non-edge to $G$ creates an induced copy of $H$. Depending on the graph $H$, an $H$-induced-saturated graph does not necessarily exist. In fact, Martin and Smith (2012) showed that $P_4$-induced-saturated graphs do not exist, where $P_k$ denotes a path on $k$ vertices. Axenovich and Csik\'{o}s (2019) asked the existence of $P_k$-induced-saturated graphs for $k \ge 5$; it is easy to construct such graphs when $k\in\{2, 3\}$. Recently, R\"{a}ty constructed a graph that is $P_6$-induced-saturated. In this paper, we show that there exists a $P_{k}$-induced-saturated graph for infinitely many values of $k$. To be precise, we find a $P_{3n}$-induced-saturated graph for every positive integer $n$. As a consequence, for each positive integer $n$, we construct infinitely many $P_{3n}$-induced-saturated graphs. We also show that the Kneser graph $K(n,2)$ is $P_6$-induced-saturated for every $n\ge 5$.

Published
2019

29. Sharp conditions for the existence of an even $[a,b]$-factor in a graph

Author

Cho, Eun-Kyung, Hyun, Jong Yoon, O, Suil, and Park, Jeong Rye

Subjects
Mathematics - Combinatorics, 05C70, 05C40, 05C50
Abstract

Let $a$ and $b$ be positive integers. An even $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for every vertex $v \in V(G)$, $d_H(v)$ is even and $a \le d_H(v) \le b$. Matsuda conjectured that if $G$ is an $n$-vertex 2-edge-connected graph such that $n \ge 2a+b+\frac{a^2-3a}b - 2$, $\delta(G) \ge a$, and $\sigma_2(G) \ge \frac{2an}{a+b}$, then $G$ has an even $[a,b]$-factor. In this paper, we provide counterexamples, which are highly connected. Furthermore, we give sharp sufficient conditions for a graph to have an even $[a,b]$-factor. For even $an$, we conjecture a lower bound for $\lambda_1(G)$ in an $n$-vertex graph to have an $[a,b]$-factor, where $\lambda_1(G)$ is the largest eigenvalue of $G$., Comment: 13 pages, 2 figures

Published
2018

30. Overall survival in the OlympiA phase III trial of adjuvant olaparib in patients with germline pathogenic variants in BRCA1/2 and high-risk, early breast cancer

Author

Sevelda, Paul, Haslbauer, Ferdinand, Penzinger, Monika, Öhler, Leopold, Tinchon, Christoph, Greil, Richard, Heibl, Sonja, Bartsch, Rupert, Wette, Viktor, Singer, Christian F., Pasterk, Claudia, Helfgott, Ruth, Pristauz-Telsnigg, Gunda, Stöger, Herbert, Weltermann, Angsar, Egle, Daniel, Thiel, Irene, Fuchs, David, Rumpold, Holger, Strasser-Weippl, Kathrin, Rautenberg, Beate, Müller, Volkmar, Schmidt, Marcus, Paepke, Stefan, Aydogdu, Mustafa, Thomssen, Christoph, Rom, Joachim, Mau, Christine, Fasching, Peter, Göhring, Uwe-Jochen, Kühn, Thorsten, Noeding, Stefanie, Kümmel, Sherko, Hackmann, John, Stickeler, Elmar, Joshi, Abhishek, Dewar, Joanna, Friedlander, Michael, Phillips, Kelly-Anne, Antill, Yoland, Woodward, Natasha, Abdi, Ehtesham, Tiley, Susan, George, Mathew, Boadle, David, Goodwin, Annabel, van der Westhuizen, Andre, Kannourakis, George, Murray, Nicholas, McCarthy, Nicole, Kroep, Judith, de Boer, Maaike, Heijns, Joan, Jager, Agnes, Erdkamp, Franciscus, Bakker, Sandra, Sonke, Gabe S., Sami, Amer, Mackey, John, Prady, Catherine, Eisen, Andrea, Desbiens, Christine, Patocskai, Erica, Ferrario, Cristiano, Gelmon, Karen, Bordeleau, Louise, Chalchal, Haji, Niraula, Saroj, ido wolf, Senkus, Elżbieta, Duhoux, François, Randal d’Hondt, Luce, Sylvie, Roodenbeke, Daphné t’Kint de, Papadimitriou, Konstantinos, Borms, Marleen, Quaghebeur, Claire, Jacot, William, Brain, Etienne, Venat-Bouvet, Laurence, Lortholary, Alain, Nowecki, Zbigniew, Cardoso, Fátima, Hayward, Richard, Bella, Santiago, Lazzaro, Mauricio Fernández, Pilnik, Norma, Fein, Luis E., Blajman, Cesar, Lerzo, Guillermo, Varela, Mirta, Zarba, Juan Jose, Kaen, Diego, Constanzo, Maria Victoria, Tio, Joke, Siggelkow, Wulf, Jackisch, Christian, Grischke, Eva Maria, Zahm, Dirk, Tato-Varela, Sara, Schmatloch, Sabine, Klare, Peter, Stefek, Andrea, Rhiem, Kerstin, Hoffmann, Oliver, Deryal, Mustafa, Gröll, Isolde, Ledwon, Peter, Uleer, Christoph, Krabisch, Petra, Potenberg, Jochem, Darsow, Maren, Park-Simon, Tjoung-Won, Höffkes, Heinz-Gert, Emde, Till-Oliver, Graffunder, Gerd, Tomé, Oliver, Forstmeyer, Dirk, Terhaag, Jürgen, Salat, Christoph, Kast, Karin, Weniger, Steffi, Schreiber, Carsten, Heinrich, Bernhard, Dieterich, Max, Wüllner, Michaela Penelope, Conejero, Raquel Andrés, García Sáenz, José Ángel, Martinez, Lourdes Calvo, Lanza, Angels Arcusa, Murillo, Serafín Morales, Carrasco, Fernando Henao, Tormo, Salvador Blanch, López, Isabel Álvarez, Delgado Mingorance, Juan Ignacio, Gomez, Elena Álvarez, Santisteban, Marta, Jurado, Josefina Cruz, Quiroga, Vanesa, Borrego, Manuel Ruiz, Martínez de Dueñas, Eduardo, Alés Martínez, Jose Enrique, De la Haba, Juan, Jañez, Noelia Martínez, Lescure, Álvaro Rodríguez, Torres, Antonio Antón, Crusades, Gema Llort, González-Santiago, Santiago, Aragones, Antonia Marquez, Ortega, Ana Laura, Molins, Agusti Barnadas, Chacón López-Muñiz, José Ignacio, Jiménez, Miguel Martín, Bertrán, Ana Santaballa, Rodríguez, César, Cortijo, Lucía González, Cretella, Elisabetta, Cortesi, Laura, Ruggeri, Enzo Maria, Verusio, Claudio, Gori, Stefania, Bonetti, Andrea, Mosconi, Anna Maria, Johannsson, Oskar, Jerusalem, Guy, Neven, Patrick, Nagy, Tünde, Pinotti, Graziella, Colleoni, Marco A., Bernardo, Antonio, Gianni, Lorenzo, Bucci, Eraldo, Biganzoli, Laura, Dedes, Konstantin, Novak, Urban, Zaman, Khalil, Braybrooke, Jeremy, Winter, Matthew, Rea, Daniel, Kelleher, Muireann, Barrett, Sophie, Chan, Stephen, Hickish, Tamas, Hurwitz, Jane, Conibear, John, Jegannathen, Apurna, Parton, Marina, Tutt, Andrew, Allerton, Rozenn, Borley, Annabel, Armstrong, Anne, Copson, Ellen, Levitt, Nicola, Abraham, Jean, Perren, Timothy, Roylance, Rebecca, Ishida, Kazushige, Toyama, Tatsuya, Masuda, Norikazu, Watanabe, Junichiro, Tokunaga, Eriko, Kinoshita, Takayuki, Rai, Yoshiaki, Takada, Masahiro, Yanagita, Yasuhiro, Nakamura, Rikiya, Nakayama, Takahiro, Naoi, Yasuto, Iwata, Hiroji, Nakamura, Seigo, Takahashi, Masato, Aogi, Kenjiro, Tsugawa, Koichiro, Mukai, Hirofumi, Takano, Toshimi, Osaki, Akihiko, Sato, Nobuaki, Yamauchi, Hideko, Tokuda, Yutaka, Ito, Mitsuya, Sugimoto, Takeki, Bahadur, Shakeela W., Ganz, Patricia A., Lu, Min J., Mita, Monica M., Waisman, James, Polikoff, Jonathan A., Telli, Melinda L., Seaward, Samantha A., Suga, J. Marie, Durna, Lara N., Carney, Jennifer Fu, Menter, Alex, Puthillath, Ajithkumar, Rohatgi, Nitin, Feusner, James H., Bobolis, Kristie A., Eisenberg, Peter D., Wong, Derrick, Borges, Virginia F., Urquhart, Alexander T., Hofstatter, Erin W., McCarron, Edward C., Isaacs, Claudine, Herbolsheimer, Pia, Varadarajan, Ramya, Raben, Adam, Deveras, Ruby Anne E., Valdes-Albini, Frances, Mahtani, Reshma L., Meisel, Jane L., Sumrall, Bradley T., Jones, Cheryl F., Ofori, Samuel N., Sumida, Kenneth N.M., Karwal, Mark, Wilbur, Deborah W., Singh, (Joe), Spector, David M., Schallenkamp, John, Merkel, Douglas E., Lo, Shelly S., Khosla, Pam G., Cristofanilli, Massimo, Flaum, Lisa, Hoskins, Kent F., Cobleigh, Melody A., Lambiase, Elyse A., Hahn, Olwen M., Oliff, Ira A., Faller, Bryan A., Wade, James L., Burhani, Nafisa D., Gil, Amaryllis, Einhorn, Harvey E., Storniolo, Anna M.V., Chang, Brian K., Kalra, Maitri, Robin, Erwin L., Ansari, Bilal, Sharma, Priyanka, Dakhil, Shaker R., Deming, Richard L., Cole, John T., Hanson, David S., Ochoa, Augusto C., Garber, Judy E., Zimbler, Harvey, Armstrong, Deborah K., Tkaczuk, Katherine H.R., Riseberg, David A., O'Connor, Brian M., Openshaw, Thomas H., Zakalik, Dana, Vakhariya, Cynthia M., Schott, Anne F., Simon, Michael S., Doyle, Thomas J., Al Baghdadi, Tareq, VanderWoude, Amy, Flynn, Patrick J., Zera, Richard T., Friday, Bret E.B., Ruddy, Kathryn J., Smith, Ron, Ademuyiwa, Olabisi, Foluso, Ellis, Robert, Carlson, Jay W., Marchello, T, Benjamin, Levine, Edward A., Marcom, Paul K., Harkness, Cameron B., Tan, Antoinette R., Charles, William J., Kuzma, Charles S., Asaad, Shonda, Radford, James E., Steen, Preston D., Unnikrishnan, Madhu, Seeger, Grant R., Leu, Kirsten M.H., Copur, Mehmet S., Hauke, Ralph J., Soori, Gamini S., Arrick, Bradley A., Reeder, Jennifer G., Toppmeyer, Deborah L., Dayao, Zoneddy R., Adams, Sylvia, Andreopoulou, Eleni, Allison, Magnuson, Anampa Mesias, Jesus D., Sharma, Ruby, Ramaswamy, Bhuvaneswari, Gerds, Aaron T., Shenk, Robert R., Gross, Howard M., Trehan, Shruti, Razaq, Wajeeha, Mansoor, Abdul H., Hilton, Christie J., Brufsky, Adam M., Huynh, Chanh, Chowdhury, Nabila, Domchek, Susan M., Sigurdson, Elin R., Cescon, Terrence P., Rovito, Marc A., DeNittis, Albert S., Vogel, Victor G., Julian, Thomas B., Boyle, L.E., Baez-Diaz, Luis, Brescia, Frank J., Doster, John E., Siegel, Robert D., Wong, Lucas, Patel, Tejal, Nangia, Julie R., Jones, Catherine A., Cannon, George M., Bear, Harry D., Vachhani, Hetal, Wilkinson, Mary, Wood, Marie E., Yan, Fengting, Sui, Xingwei, van Haelst, Carol M., Specht, Jennifer M., Zhuo, Ying, Qamar, Rubina, Ryan, Matthew L., Stockham, Abigail, Virani, Shamsuddin, Gayle, Arlene A., Jubelirer, Steven J., Kurian, Sobha, Salkeni, Mohamad A., Loman, Niklas, Linderholm, Barbro, Silander, Gustav, Hallbeck, Anna-Lotta, von Wachenfeldt Väppling, Anna, Curtit, Elsa, Cardoso, Catarina, Braga, Sofia, Abreu, Miguel, Casa-Nova, Mafalda, Nave, Mónica, Ciruelos Gil, Eva María, Gelpi, Judith Balmaña, Ortega, Adela Fernández, Padró, Josep Gumà, Bermejo de las Heras, Begoña, Cao, María González, Bañuelos, Juan Cueva, Company, Jesús Alarcon, Villaró, Gemma Viñas, Estevez, Laura García, Huober, Jens, Busch, Steffi, Fehm, Tanja, Hahn, Antje, Grafe, Andrea, Noesselt, Thomas, Dewitz, Thomas, Wagner, Harald, Bechtner, Christina, Weigel, Michael, Kolberg, Hans-Christian, Decker, Thomas, Thomalla, Jörg, Hesse, Tobias, Harbeck, Nadia, Jens-Uwe Blohmer, Jan Schröder, Wolf Sütterlin, Marc, Altena, Renske, Chiu, Chang-Fang, Chen, Shin-Cheh, Hou, Ming-Feng, Chang, Yuan-Ching, Chen, Shang-Hung, Chen, Shou-Tung, Huang, Chiun-Sheng, Yeh, Dah-Cherng, Yu, Jyh-Cherng, Tseng, Ling-Ming, Chung, Wei-Pang, Mailliez, Audrey, Petit, Thierry, Delaloge, Suzette, Lévy, Christelle, Dalivoust, Philippe, Extra, Jean-Marc, Mouret-Reynier, Marie-Ange, Hardy-Bessard, Anne-Claire, Simon, Hélène, L'Haridon, Tiffenn, Mege, Alice, Giacchetti, Sylvie, Chakiba-Brugere, Camille, Gratet, Alain, Pottier, Virginie, Ferrero, Jean-Marc, Tennevet, Isabelle, Perrin, Christophe, Canon, Jean-Luc, Joris, Sofie, Shao, Zhimin, Xu, Binghe, Jiang, ZeFei, Sun, Qiang, Shen, Kunwei, Pang, Da, Zhang, Jin, Wang, Shui, Yang, Hongjian, Liao, Ning, Zheng, Hong, Fu, Peifen, Song, Chuangui, Wang, Yongsheng, Fan, Zhimin, Geng, Cuizhi, Tredan, Olivier, Landherr, László, Kaufman, Bella, Yerushalmi, Rinat, Uziely, Beatrice, Conte, Pierfranco, Zamagni, Claudio, Bianchini, Giampaolo, De Laurentiis, Michelino, Tondini, Carlo, Gebbia, Vittorio, Ciccarese, Mariangela, Sarosiek, Tomasz, Mackiewicz, Jacek, Słowińska, Anna, Kalinka, Ewa, Huzarski, Tomasz, Im, Seock-Ah, Jung, Kyung Hae, Sohn, Joo Hyuk, Kim, Jee Hyun, Lee, Keun Seok, Park, Yeon Hee, Lee, Kyoung Eun, Chae, Yee Soo, Cho, Eun Kyung, Geyer, C.E., Jr., Garber, J.E., Gelber, R.D., Yothers, G., Taboada, M., Ross, L., Rastogi, P., Cui, K., Arahmani, A., Aktan, G., Armstrong, A.C., Arnedos, M., Balmaña, J., Bergh, J., Bliss, J., Delaloge, S., Domchek, S.M., Eisen, A., Elsafy, F., Fein, L.E., Fielding, A., Ford, J.M., Friedman, S., Gelmon, K.A., Gianni, L., Gnant, M., Hollingsworth, S.J., Im, S.-A., Jager, A., Jóhannsson, Ó. Þ, Lakhani, S.R., Janni, W., Linderholm, B., Liu, T.-W., Loman, N., Korde, L., Loibl, S., Lucas, P.C., Marmé, F., Martinez de Dueñas, E., McConnell, R., Phillips, K.-A., Piccart, M., Rossi, G., Schmutzler, R., Senkus, E., Shao, Z., Sharma, P., Singer, C.F., Španić, T., Stickeler, E., Toi, M., Traina, T.A., Viale, G., Zoppoli, G., Park, Y.H., Yerushalmi, R., Yang, H., Pang, D., Jung, K.H., Mailliez, A., Fan, Z., Tennevet, I., Zhang, J., Nagy, T., Sonke, G.S., Sun, Q., Parton, M., Colleoni, M.A., Schmidt, M., Brufsky, A.M., Razaq, W., Kaufman, B., Cameron, D., Campbell, C., and Tutt, A.N.J.

Published
2022
Full Text
View/download PDF

32. A spectral characterisation of t-designs and its applications

Author

Cho, Eun-Kyung, Ding, Cunsheng, and Hyun, Jong Yoon

Subjects
Mathematics - Combinatorics, Computer Science - Information Theory, 05B05, 51E10, 94B15
Abstract

There are two standard approaches to the construction of $t$-designs. The first one is based on permutation group actions on certain base blocks. The second one is based on coding theory. The objective of this paper is to give a spectral characterisation of all $t$-designs by introducing a characteristic Boolean function of a $t$-design. The spectra of the characteristic functions of $(n-2)/2$-$(n, n/2, 1)$ Steiner systems are determined and properties of such designs are proved. Delsarte's characterisations of orthogonal arrays and $t$-designs, which are two special cases of Delsarte's characterisation of $T$-designs in association schemes, are slightly extended into two spectral characterisations. Another characterisation of $t$-designs by Delsarte and Seidel is also extended into a spectral one. These spectral characterisations are then compared with the new spectral characterisation of this paper.

Published
2017

33. A Phase 1/2 Study of Lazertinib 240 mg in Patients With Advanced EGFR T790M-Positive NSCLC After Previous EGFR Tyrosine Kinase Inhibitors

Author

Cho, Byoung Chul, Han, Ji-Youn, Kim, Sang-We, Lee, Ki Hyeong, Cho, Eun Kyung, Lee, Yun-Gyoo, Kim, Dong-Wan, Kim, Joo-Hang, Lee, Gyeong-Won, Lee, Jong-Seok, Shim, Byoung Yong, Kim, Jin-Soo, Chun, Sang Hoon, Lee, Sung Sook, Kim, Hye Ryun, Hong, Min Hee, Ahn, Jin Seok, Sun, Jong-Mu, Lee, Youngjoo, Lee, Dae Ho, Kang, Ji Ah, Lee, NaMi, Kwon, Mi-Jung, Espenschied, Carin, Yablonovitch, Arielle, and Ahn, Myung-Ju

Published
2022
Full Text
View/download PDF

36. Clinical effectiveness of olaparib monotherapy in germline BRCA-mutated, HER2-negative metastatic breast cancer in a real-world setting: phase IIIb LUCY interim analysis

Author

Timcheva, Constanta, Tomova, Antoaneta, Eisen, Andrea, Gelmon, Karen, Lemieux, Julie, Bazan, Fernando, Bourgeois, Hugues, Chakiba, Camille, Chehimi, Mohamad, Dalenc, Florence, De La Motte Rouge, Thibault, Frenel, Jean-Sébastien, Gonçalves, Anthony, Hardy-Bessard, Anne Claire, Lamy, Regine, Levy, Christelle, Lortholary, Alain, Mailliez, Audrey, Medioni, Jacques, Patsouris, Anne, Spaeth, Dominique, Teixeira, Luis, Tennevet, Isabelle, Villanueva, Cristian, You, Benoit, Ettl, Johannes, Gerber, Bernd, Hoffmann, Oliver, Park-Simon, Tjoung-Won, Reinisch, Mattea, Tio, Joke, Wimberger, Pauline, Boer, Katalin, Ballestrero, Alberto, Bianchini, Giampaolo, Biganzoli, Laura, Bordonaro, Roberto, Cognetti, Francesco, De Laurentiis, Michelino, De Placido, Sabino, Guarneri, Valentina, Montemurro, Filippo, Naso, Giuseppe, Santoro, Armando, Zamagni, Claudio, Kim, Seung-Jin, Nakamura, Seigo, Chae, Yee Soo, Cho, Eun Kyung, Hyun, Kim Jee, Im, Seock-Ah, Lee, Keun Seok, Park, Yeon Hee, Sohn, Joo Hyuk, Byrski, Tomasz, Huzarski, Tomasz, Kukielka-Budny, Bozena, Nowecki, Zbigniew, Szoszkiewicz, Renata, Tarnawski, Rafal, Dvornichenko, Viktoria, Moiseenko, Fedor, Mukhametshina, Guzel, Poddubskaya, Elena, Popova, Ekaterina, Tarasova, Anna, Vats, Anna, Adamo, Bárbara, Conejero, Raquel Andrés, Torres, Antonio Antón, Gelpi, Judith Balmaña, Fernández, Nieves Díaz, González, Alejandro Falcón, Garcia, Juan, Lorenzo-Lorenzo, Isabel, Antón, Fernando Moreno, Santisteban, Marta, Stradella, Agostina, Huang, Chiun-Sheng, Aksoy, Sercan, Arslan, Cagatay, Artac, Mehmet, Aydiner, Adnan, Ozyilkan, Ozgur, Sezer, Emel, Armstrong, Anne, Barrett, Sophie, Borley, Annabel, Kemp, Zoe, Michie, Caroline, Mukesh, Mukesh, Perren, Timothy, Swampillai, Angela, Young, Tammy, Gelmon, Karen A., Fasching, Peter A., Couch, Fergus J., Balmaña, Judith, Delaloge, Suzette, Labidi-Galy, Intidhar, Bennett, James, McCutcheon, Susan, Walker, Graham, and O'Shaughnessy, Joyce

Published
2021
Full Text
View/download PDF

37. Ginsenoside Rg3 restores hepatitis C virus–induced aberrant mitochondrial dynamics and inhibits virus propagation

Author

Kim, Seong‐Jun, Jang, Jae Young, Kim, Eun‐Jung, Cho, Eun Kyung, Ahn, Dae‐Gyun, Kim, Chonsaeng, Park, Han Seul, Jeong, Soung Won, Lee, Sae Hwan, Kim, Sang Gyune, Kim, Young Seok, Kim, Hong Soo, Kim, Boo Sung, Lee, Jihyung, and Siddiqui, Aleem

Subjects
Medical Microbiology, Biomedical and Clinical Sciences, Infectious Diseases, Hepatitis, Hepatitis - C, Chronic Liver Disease and Cirrhosis, Liver Disease, Digestive Diseases, Emerging Infectious Diseases, 5.1 Pharmaceuticals, Development of treatments and therapeutic interventions, Infection, Good Health and Well Being, Biopsy, Needle, Blotting, Western, Cell Survival, Cells, Cultured, Fluorescent Antibody Technique, Ginsenosides, Hepacivirus, Hepatitis C, Chronic, Humans, Immunity, Innate, Immunohistochemistry, Mitochondria, Liver, Mitochondrial Dynamics, Real-Time Polymerase Chain Reaction, Sampling Studies, Virus Replication, Medical Biochemistry and Metabolomics, Clinical Sciences, Immunology, Gastroenterology & Hepatology, Clinical sciences
Abstract

Hepatitis C virus (HCV) alters mitochondrial dynamics associated with persistent viral infection and suppression of innate immunity. Mitochondrial dysfunction is also a pathologic feature of direct-acting antiviral (DAA) treatment. Despite the high efficacy of DAAs, their use in treating patients with chronic hepatitis C in interferon-sparing regimens occasionally produces undesirable side effects such as fatigue, migraine, and other conditions, which may be linked to mitochondrial dysfunction. Here, we show that clinically prescribed DAAs, including sofosbuvir, affect mitochondrial dynamics. To counter these adverse effects, we examined HCV-induced and DAA-induced aberrant mitochondrial dynamics modulated by ginsenoside, which is known to support healthy mitochondrial physiology and the innate immune system. We screened several ginsenoside compounds showing antiviral activity using a robust HCV cell culture system. We investigated the role of ginsenosides in antiviral efficacy, alteration of mitochondrial transmembrane potential, abnormal mitochondrial fission, its upstream signaling, and mitophagic process caused by HCV infection or DAA treatment. Only one of the compounds, ginsenoside Rg3 (G-Rg3), exhibited notable and promising anti-HCV potential. Treatment of HCV-infected cells with G-Rg3 increased HCV core protein-mediated reduction in the expression level of cytosolic p21, required for increasing cyclin-dependent kinase 1 activity, which catalyzes Ser616 phosphorylation of dynamin-related protein 1. The HCV-induced mitophagy, which follows mitochondrial fission, was also rescued by G-Rg3 treatment.ConclusionG-Rg3 inhibits HCV propagation. Its antiviral mechanism involves restoring the HCV-induced dynamin-related protein 1-mediated aberrant mitochondrial fission process, thereby resulting in suppression of persistent HCV infection. (Hepatology 2017;66:758-771).

Published
2017

40. Independent domination versus packing in subcubic graphs.

Author

Cho, Eun-Kyung and Kim, Minki

Abstract

In 2011, Henning, Löwenstein, and Rautenbach observed that the domination number of a graph is bounded above by the product of the packing number and the maximum degree of the graph. In this paper, we prove a stronger statement in subcubic graphs: The independent domination number is at most three times the packing number. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

41. A Randomized-Controlled Phase 2 Study of the MET Antibody Emibetuzumab in Combination with Erlotinib as First-Line Treatment for EGFR Mutation–Positive NSCLC Patients

Author

Scagliotti, Giorgio, Moro-Sibilot, Denis, Kollmeier, Jens, Favaretto, Adolfo, Cho, Eun Kyung, Grosch, Heidrun, Kimmich, Martin, Girard, Nicolas, Tsai, Chun-Ming, Hsia, Te-Chun, Brighenti, Matteo, Schumann, Christian, Wang, Xuejing Aimee, Wijayawardana, Sameera R., Gruver, Aaron M., Wallin, Johan, Mansouri, Kambiz, Wacheck, Volker, and Chang, Gee-Chen

Published
2020
Full Text
View/download PDF

42. Adjuvant Erlotinib Versus Placebo in Patients With Stage IB-IIIA Non–Small-Cell Lung Cancer (RADIANT): A Randomized, Double-Blind, Phase III Trial

Author

Kelly, Karen, Altorki, Nasser K, Eberhardt, Wilfried EE, O'Brien, Mary ER, Spigel, David R, Crinò, Lucio, Tsai, Chun-Ming, Kim, Joo-Hang, Cho, Eun Kyung, Hoffman, Philip C, Orlov, Sergey V, Serwatowski, Piotr, Wang, Jiuzhou, Foley, Margaret A, Horan, Julie D, and Shepherd, Frances A

Subjects
Cancer, Lung Cancer, Prevention, Clinical Trials and Supportive Activities, Lung, Clinical Research, Evaluation of treatments and therapeutic interventions, 6.1 Pharmaceuticals, Adult, Aged, Aged, 80 and over, Antineoplastic Agents, Carcinoma, Non-Small-Cell Lung, Chemotherapy, Adjuvant, Double-Blind Method, ErbB Receptors, Erlotinib Hydrochloride, Female, Follow-Up Studies, Humans, International Agencies, Lung Neoplasms, Male, Middle Aged, Mutation, Neoplasm Staging, Prognosis, Survival Rate, Young Adult, Clinical Sciences, Oncology and Carcinogenesis, Oncology & Carcinogenesis
Abstract

PurposeEpidermal growth factor receptor (EGFR) -tyrosine kinase inhibitors have proven efficacy in advanced non-small-cell lung cancer (NSCLC). We hypothesized that erlotinib would be efficacious in the adjuvant setting.Patients and methodsAn international randomized, double-blind, placebo-controlled study was conducted in patients with completely resected IB to IIIA NSCLC whose tumors expressed EGFR protein by immunohistochemistry or EGFR amplification by fluorescence in situ hybridization. Patients were assigned 2:1 to erlotinib 150 mg once per day or placebo for 2 years. Stratification factors were stage, histology, previous adjuvant chemotherapy, smoking status, EGFR amplification status, and country. The primary end point was disease-free survival (DFS); key secondary end points were overall survival (OS) and DFS and OS in patients whose tumors had EGFR-activating mutations (EGFRm-positive).ResultsA total of 973 patients were randomly assigned (November 26, 2007, to July 7, 2010). There was no statistically significant difference in DFS (median, 50.5 months for erlotinib and 48.2 months for placebo; hazard ratio, 0.90; 95% CI, 0.74 to 1.10; P = .324). Among the 161 patients (16.5%) in the EGFRm-positive subgroup, DFS favored erlotinib (median, 46.4 v 28.5 months; hazard ratio, 0.61; 95% CI, 0.38 to 0.98; P = .039), but this was not statistically significant because of the hierarchical testing procedure. OS data are immature. Rash and diarrhea were common adverse events occurring in 528 (86.4%) and 319 (52.2%) patients treated with erlotinib, respectively, versus 110 (32.1%) and 54 (15.7%) patients receiving placebo. The most common grade 3 adverse events in patients treated with erlotinib were rash (22.3%) and diarrhea (6.2%).ConclusionAdjuvant erlotinib did not prolong DFS in patients with EGFR-expressing NSCLC or in the EGFRm-positive subgroup. Further evaluation of erlotinib is warranted in the EGFRm-positive subgroup.

Published
2015

44. Lazertinib in patients with EGFR mutation-positive advanced non-small-cell lung cancer: results from the dose escalation and dose expansion parts of a first-in-human, open-label, multicentre, phase 1–2 study

Author

Ahn, Myung-Ju, Han, Ji-Youn, Lee, Ki Hyeong, Kim, Sang-We, Kim, Dong-Wan, Lee, Yun-Gyoo, Cho, Eun Kyung, Kim, Joo-Hang, Lee, Gyeong-Won, Lee, Jong-Seok, Min, Young Joo, Kim, Jin-Soo, Lee, Sung Sook, Kim, Hye Ryun, Hong, Min Hee, Ahn, Jin Seok, Sun, Jong-Mu, Kim, Heung Tae, Lee, Dae Ho, Kim, Sohee, and Cho, Byoung Chul

Published
2019
Full Text
View/download PDF

45. Durvalumab plus platinum–etoposide versus platinum–etoposide in first-line treatment of extensive-stage small-cell lung cancer (CASPIAN): a randomised, controlled, open-label, phase 3 trial

Author

Batagelj, Emilio, Casarini, Ignacio, Pastor, Anea Viviana, Sena, Susana Noemi, Zarba, Juan Jose, Burghuber, Otto, Hartl, Sylvia, Hochmair, Maximilian J, Lamprecht, Bernd, Studnicka, Michael, Alberto Schlittler, Luis, Augusto Martinelli de Oliveira, Fabricio, Calabrich, Aknar, Colagiovanni Girotto, Gustavo, Dos Reis, Peo, Fausto Nino Gorini, Carlos, Rafael Martins De Marchi, Peo, Serodio da Rocha Baldotto, Clarissa, Sette, Claudia, Zukin, Mauro, Conev, Nikolay V, Dudov, Assen, Ilieva, Rumyana, Koynov, Krassimir, Krasteva, Rositsa, Tonev, Ivan, Valev, Spartak, Venkova, Violetka, Bi, Minghong, Chen, Chengshui, Chen, Yuan, Chen, Zhendong, Fang, Jian, Feng, Jifeng, Han, Zhigang, Hu, Jie, Hu, Yi, Li, Wei, Liang, Zongan, Lin, Zhong, Ma, Rui, Ma, Shenglin, Nan, Kejun, Shu, Yongqian, Wang, Kai, Wang, Mengzhao, Wu, Gang, Yang, Nong, Yang, Zhixiong, Zhang, Helong, Zhang, Wei, Zhao, Jun, Zhao, Yanqiu, Zhou, Caicun, Zhou, Jianying, Zhou, Xiangdong, Havel, Libor, Kolek, Vitezslav, Koubkova, Leona, Roubec, Jaromir, Skrickova, Jana, Zemanova, Milada, Chouaid, Christos, Hilgers, Werner, Lena, Hervé, Moro-Sibilot, Denis, Robinet, Gilles, Souquet, Pierre-Jean, Alt, Jürgen, Bischoff, Helge, Grohe, Christian, Laack, Eckart, Lang, Susanne, Panse, Jens, Reinmuth, Niels, Schulz, Christian, Bogos, Krisztina, Csánky, Eszter, Fülöp, Anea, Horváth, Zsolt, Kósa, Judit, Laczó, Ibolya, Losonczy, György, Pajkos, Gábor, Pápai, Zsuzsanna, Pápai Székely, Zsolt, Sárosi, Veronika, Somfay, Attila, Somogyiné Ezer, Éva, Telekes, Anás, Bar, Jair, Gottfried, Maya, Heching, Norman Isaac, Zer Kuch, Alona, Bartolucci, Roberta, Bettini, Anna Cecilia, Delmonte, Angelo, Garassino, Marina Chiara, Minelli, Mauro, Roila, Fausto, Verderame, Francesco, Atagi, Shinji, Azuma, Koichi, Goto, Hisatsugu, Goto, Koichi, Hara, Yu, Hayashi, Hidetoshi, Hida, Toyoaki, Hotta, Katsuyuki, Kanazawa, Kenya, Kanda, Shintaro, Kim, Young Hak, Kuyama, Shoichi, Maeda, Tadashi, Morise, Masahiro, Nakahara, Yasuharu, Nishio, Makoto, Nogami, Naoyuki, Okamoto, Isamu, Saito, Haruhiro, Shinoda, Masahiro, Umemura, Shigeki, Yoshida, Tatsuya, Claessens, Niels, Cornelissen, Robin, Heniks, Lizza, Hiltermann, Jeroen, Smit, Egbert, Staal van den Brekel, Agnes, Kazarnowicz, Andrzej, Kowalski, Dariusz, Mańdziuk, Slawomir, Mróz, Robert, Wojtukiewicz, Marek, Ciuleanu, Tudor, Ganea, Doina, Ungureanu, Anei, Dvorkin, Mikhail, Luft, Alexander, Moiseenko, Vladimir, Poltoratskiy, Artem, Sakaeva, Dina, Smolin, Alexey, Statsenko, Galina, Vasilyev, Alexander, Vladimirova, Lyubov, Anasina, Igor, Chovanec, Jozef, Demo, Pavol, Godal, Robert, Kasan, Peter, Stresko, Marian, Urda, Michal, Cho, Eun Kyung, Ji, Jun Ho, Kim, Joo-Hang, Kim, Sang-We, Lee, Gyeong-Won, Lee, Jong-Seok, Lee, Ki Hyeong, Lee, Kyung Hee, Lee, Yun Gyoo, Amelia Insa Molla, Maria, Domine Gomez, Manuel, Ignacio Delgado Mingorance, Juan, Isla Casado, Dolores, Lopez Brea, Marta, Majem Tarruella, Margarita, Morán Bueno, Teresa, Navarro Mendivil, Alejano, Paz-Ares Rodríguez, Luis, Ponce Aix, Santiago, Rosario Garcia Campelo, Maria, Chang, Gee-Chen, Chen, Yen-Hsun, Chiu, Chao-Hua, Hsia, Te-Chun, Lee, Kang-Yun, Li, Chien-Te, Wang, Chin-Chou, Wei, Yu-Feng, Wu, Shang-Yin, Alacacıoğlu, Ahmet, Çiçin, Irfan, Demirkazik, Ahmet, Erman, Mustafa, Göksel, Tuncay, Özgüroğlu, Mustafa, Adamchuk, Hryhoriy, Bondarenko, Igor, Kolesnik, Oleksii, Kryzhanivska, Anna, Ostapenko, Yuriv, Shevnia, Serhii, Shparyk, Yaroslav, Trukhin, Dmytro, Ursol, Grygorii, Voitko, Nataliia, Voitko, Oleksandr, Vynnychenko, Ihor, Babu, Sunil, Chen, Yuanbin, Chiang, Anne, Chua, Winston, Dakhil, Shaker, Dowlati, Afshin, Goldman, Jonathan W, Haque, Basir, Jamil, Rodney, Knoble, Jeanna, Lakhanpal, Shailena, Mi, Kailhong, Nikolinakos, Petros, Powell, Steven, Ross, Helen, Schaefer, Eric, Schneider, Jeffrey, Spahr, Joseph, Spigel, David, Stilwill, Joseph, Sumey, Christopher, Williamson, Michael, Paz-Ares, Luis, Ponce, Santiago, Armstrong, Jon, Byrne, Natalie, Shire, Norah, and Jiang, Haiyi

Published
2019
Full Text
View/download PDF

46. Safety, tolerability, and anti-tumor activity of olmutinib in non-small cell lung cancer with T790M mutation: A single arm, open label, phase 1/2 trial

Author

Kim, Dong-Wan, Lee, Dae Ho, Han, Ji-Youn, Lee, Jongseok, Cho, Byoung Chul, Kang, Jin Hyoung, Lee, Ki Hyeong, Cho, Eun Kyung, Kim, Jin-Soo, Min, Young Joo, Cho, Jae Yong, An, Ho Jung, Kim, Hoon-Gu, Lee, Kyung Hee, Kim, Bong-Seog, Jang, In-Jin, Yoon, Seonghae, Han, OakPil, Noh, Young Su, Hong, Ka Young, and Park, Keunchil

Published
2019
Full Text
View/download PDF

49. A randomized, multicenter, open-label, phase III trial comparing anthracyclines followed by taxane versus anthracyclines followed by taxane plus carboplatin as (neo) adjuvant therapy in patients with early triple-negative breast cancer: Korean Cancer...

Author

Sohn, Joohyuk, Kim, Gun Min, Jung, Kyung Hae, Jeung, Hei-Cheul, Lee, Jieun, Lee, Keun Seok, Im, Seock-Ah, Kang, Seok Yun, Kim, Se Hyun, Kim, Han Jo, Park, Kyong Hwa, Chae, Yee Soo, Koh, Su-Jin, Cho, Eun Kyung, Park, Keon Uk, Lee, Sung Sook, Kim, Ji-Yeon, Choi, In Sil, Baek, Sun Kyung, and Moon, Yong Wha

Published
2024
Full Text
View/download PDF

50. Osimertinib versus Standard of Care EGFR TKI as First-Line Treatment in Patients with EGFRm Advanced NSCLC: FLAURA Asian Subset

Author

Cho, Byoung Chul, Chewaskulyong, Busayamas, Lee, Ki Hyeong, Dechaphunkul, Arunee, Sriuranpong, Virote, Imamura, Fumio, Nogami, Naoyuki, Kurata, Takayasu, Okamoto, Isamu, Zhou, Caicun, Cheng, Ying, Cho, Eun Kyung, Voon, Pei Jye, Lee, Jong-Seok, Mann, Helen, Saggese, Matilde, Reungwetwattana, Thanyanan, Ramalingam, Suresh S., and Ohe, Yuichiro

Published
2019
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results