![](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
Ingrid Mengersen
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
- 2023
- [j18]Roland Lortz, Ingrid Mengersen:
On the Ramsey numbers of non-star trees versus connected graphs of order six. Discuss. Math. Graph Theory 43(2): 331-349 (2023) - 2021
- [j17]Roland Lortz, Ingrid Mengersen:
All missing Ramsey numbers for trees versus the four-page book. Electron. J. Graph Theory Appl. 9(2): 377-386 (2021) - [j16]Roland Lortz
, Ingrid Mengersen:
Size Ramsey Results for the Path of Order Three. Graphs Comb. 37(6): 2315-2331 (2021)
2010 – 2019
- 2019
- [j15]Roland Lortz, Ingrid Mengersen:
On the Ramsey number for stars versus connected graphs of order six. Australas. J Comb. 73: 1-24 (2019) - 2011
- [j14]Roland Lortz, Ingrid Mengersen:
Ramsey numbers for small graphs versus small disconnected graphs. Australas. J Comb. 51: 89-108 (2011)
2000 – 2009
- 2006
- [j13]Roland Lortz, Ingrid Mengersen:
Further Ramsey Numbers for Small Complete Bipartite Graphs. Ars Comb. 79 (2006) - [c1]Ingrid Mengersen, Peter Riegler:
Computergestützte Mathematiktests im Informatikstudium. DeLFI 2006: 63-74 - 2003
- [j12]Roland Lortz, Ingrid Mengersen:
Off-diagonal and asymptotic results on the Ramsey number r(K2, m, K2, n). J. Graph Theory 43(4): 252-268 (2003) - 2001
- [j11]Heiko Harborth, Ingrid Mengersen:
Ramsey numbers in octahedron graphs. Discret. Math. 231(1-3): 241-246 (2001) - 2000
- [j10]Ingrid Mengersen, Jörg Oeckermann:
Ramsey Sets for Matchings. Ars Comb. 56 (2000)
1990 – 1999
- 1999
- [j9]Ingrid Mengersen, Jörg Oeckermann:
Matching-star Ramsey Sets. Discret. Appl. Math. 95(1-3): 417-424 (1999) - 1998
- [j8]Roland Lortz, Ingrid Mengersen:
Size Ramsey results for paths versus stars. Australas. J Comb. 18: 3-12 (1998) - 1996
- [j7]Martin Harborth, Ingrid Mengersen:
Some Ramsey numbers for complete bipartite graphs. Australas. J Comb. 13: 119-128 (1996) - [j6]Kathrin Klamroth, Ingrid Mengersen:
Ramsey numbers of K3 versus (p, q)-graphs. Ars Comb. 43 (1996) - 1995
- [j5]Heiko Harborth, Ingrid Mengersen, Richard H. Schelp:
The drawing Ramsey number Dr(Kn). Australas. J Comb. 11: 151-156 (1995)
1980 – 1989
- 1989
- [j4]Heiko Harborth, Ingrid Mengersen:
All Ramsey numbers for five vertices and seven or eight edges. Discret. Math. 73(1-2): 91-98 (1989) - [j3]C. R. J. Clapham, Geoffrey Exoo, Heiko Harborth, Ingrid Mengersen, J. Sheehan:
The ramsey number of k5 - e. J. Graph Theory 13(1): 7-15 (1989) - 1986
- [j2]Heiko Harborth, Ingrid Mengersen:
Point sets with many unit circles. Discret. Math. 60: 193-197 (1986) - 1985
- [j1]Heiko Harborth, Ingrid Mengersen:
An upper bound for the ramsey number r(K5 - e). J. Graph Theory 9(4): 483-485 (1985)
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-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint