![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Ruth Luo
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Alexandr V. Kostochka, Ruth Luo, Grace McCourt:
A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-Connected Graphs. Comb. 44(4): 849-880 (2024) - [j21]Alexandr V. Kostochka, Ruth Luo, Grace McCourt
:
On a property of 2-connected graphs and Dirac's Theorem. Discret. Math. 347(11): 114153 (2024) - [j20]Alexandr V. Kostochka, Ruth Luo, Grace McCourt:
Dirac-type theorems for long Berge cycles in hypergraphs. J. Comb. Theory B 168: 159-191 (2024) - 2023
- [j19]Zoltán Füredi, Ruth Luo:
Induced Turán problems and traces of hypergraphs. Eur. J. Comb. 111: 103692 (2023) - [j18]Alexandr V. Kostochka, Ruth Luo, Grace McCourt:
Minimum degree ensuring that a hypergraph is hamiltonian-connected. Eur. J. Comb. 114: 103782 (2023) - 2022
- [j17]Alexandr V. Kostochka, Ruth Luo, Songling Shan:
Towards the Small Quasi-Kernel Conjecture. Electron. J. Comb. 29(3) (2022) - [j16]Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin:
Longest cycles in 3-connected hypergraphs and bipartite graphs. J. Graph Theory 99(4): 758-782 (2022) - 2021
- [j15]Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin:
Conditions for a Bigraph to be Super-Cyclic. Electron. J. Comb. 28(1): 1 (2021) - [j14]Zoltán Füredi, Ruth Luo:
Large Monochromatic Components in Almost Complete Graphs and Bipartite Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j13]Ruth Luo, Sam Spiro:
Forbidding $K_{2, t}$ Traces in Triple Systems. Electron. J. Comb. 28(2): 2 (2021) - 2020
- [j12]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
Berge Cycles in Non-Uniform Hypergraphs. Electron. J. Comb. 27(3): 3 (2020) - [j11]Alexandr V. Kostochka, Ruth Luo:
On r-uniform hypergraphs with circumference less than r. Discret. Appl. Math. 276: 69-91 (2020) - [j10]Alexandr V. Kostochka, Ruth Luo, Dara Zirlin:
Super-pancyclic hypergraphs and bipartite graphs. J. Comb. Theory B 145: 450-465 (2020)
2010 – 2019
- 2019
- [j9]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
On 2-Connected Hypergraphs with No Long Cycles. Electron. J. Comb. 26(4): 4 (2019) - [j8]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
:
A variation of a theorem by Pósa. Discret. Math. 342(7): 1919-1923 (2019) - [j7]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
:
Avoiding long Berge cycles. J. Comb. Theory B 137: 55-64 (2019) - 2018
- [j6]Zhanar Berikkyzy, Steve Butler, Jay Cummings, Kristin Heysse
, Paul Horn, Ruth Luo, Brent Moran:
A forest building process on simple graphs. Discret. Math. 341(2): 497-507 (2018) - [j5]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
, Jacques Verstraëte:
Stability in the Erdős-Gallai Theorem on cycles and paths, II. Discret. Math. 341(5): 1253-1263 (2018) - [j4]Ruth Luo
:
The maximum number of cliques in graphs without long cycles. J. Comb. Theory B 128: 219-226 (2018) - [j3]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
Extensions of a theorem of Erdős on nonhamiltonian graphs. J. Graph Theory 89(2): 176-193 (2018) - 2017
- [j2]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
A stability version for a theorem of Erdős on nonhamiltonian graphs. Discret. Math. 340(11): 2688-2690 (2017) - 2016
- [j1]Xingqin Qi
, Ruth Luo, Edgar Fuller
, Rong Luo, Cun-Quan Zhang:
Signed Quasi-Clique Merger: A New Clustering Method for Signed Networks with Positive and Negative Edges. Int. J. Pattern Recognit. Artif. Intell. 30(3): 1650006:1-1650006:20 (2016)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-06 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint