×

zbMATH — the first resource for mathematics

Mengersen, Ingrid

Compute Distance To:
Author ID: mengersen.ingrid Recent zbMATH articles by "Mengersen, Ingrid"
Published as: Mengersen, Ingrid; Mengersen, I.
Documents Indexed: 48 Publications since 1974

Publications by Year

Citations contained in zbMATH Open

26 Publications have been cited 75 times in 53 Documents Cited by Year
Drawings of the complete graph with maximum number of crossings. Zbl 0792.05043
Harborth, Heiko; Mengersen, Ingrid
13
1992
Matching-star Ramsey sets. Zbl 0932.05063
Mengersen, Ingrid; Oeckermann, Jörg
8
1999
The Ramsey number of \(K_ 5-e\). Zbl 0672.05062
Clapham, C.; Exoo, G.; Harborth, H.; Mengersen, I.; Sheehan, J.
7
1989
On Ramsey numbers of \(K_{2,n}\). Zbl 0739.05061
Exoo, Geoffrey; Harborth, Heiko; Mengersen, Ingrid
6
1991
The Ramsey number of \(K_{3,3}\). Zbl 0841.05070
Harborth, Heiko; Mengersen, Ingrid
5
1991
Some Ramsey numbers for complete bipartite graphs. Zbl 0854.05078
Harborth, Martin; Mengersen, Ingrid
3
1996
On the Ramsey numbers \(r(K_{2,n-1},K_{2,n})\) and \(r(K_{2,n},K_{2,n})\). Zbl 1009.05101
Lortz, Roland; Mengersen, Ingrid
3
2002
All Ramsey numbers for five vertices and seven or eight edges. Zbl 0672.05061
Harborth, Heiko; Mengersen, Ingrid
3
1989
Size Ramsey results for paths versus stars. Zbl 0914.05053
Lortz, Roland; Mengersen, Ingrid
3
1998
Ramsey numbers for graphs of order four versus connected graphs of order six. Zbl 0956.05072
Hoeth, Maik; Mengersen, Ingrid
2
2000
Three color Ramsey numbers for small graphs. Zbl 0854.05077
Arste, J.; Klamroth, K.; Mengersen, I.
2
1996
Bounds on Ramsey numbers of certain complete bipartite graphs. Zbl 1009.05100
Lortz, Roland; Mengersen, Ingrid
2
2002
The Ramsey number of \(K_ 4\) versus \(K_ 5-e\). Zbl 0648.05039
Exoo, Geoffrey; Harborth, Heiko; Mengersen, Ingrid
2
1988
Eine Ramsey-Zahl für fünf Knoten und acht Kanten. Zbl 0529.05040
Harborth, Heiko; Mengersen, Ingrid
2
1984
Edges without crossings in drawings of complete graphs. Zbl 0298.05108
Harborth, Heiko; Mengersen, Ingrid
2
1974
Off-diagonal and asymptotic results on the Ramsey number \(r(K_{2,m},K _{2,n})\). Zbl 1025.05044
Lortz, Roland; Mengersen, Ingrid
2
2003
Ramsey numbers for graph sets with fixed numbers of edges. Zbl 0794.05087
Harborth, H.; Mengersen, I.
1
1992
The drawing Ramsey number \(\text{Dr}(K_ n)\). Zbl 0828.05026
Harborth, Heiko; Mengersen, Ingrid; Schelp, Richard H.
1
1995
Ramsey numbers in octahedron graphs. Zbl 0977.05088
Harborth, Heiko; Mengersen, Ingrid
1
2001
Ein Extremalproblem für Matrizen aus Nullen und Einsen. Zbl 0417.05011
Harborth, Heiko; Mengersen, Ingrid
1
1979
Die Maximalzahl von kreuzungsfreien Kanten in Darstellungen von vollständigen n-geteilten Graphen. Zbl 0435.05021
Mengersen, Ingrid
1
1978
Ramsey numbers for small graphs versus small disconnected graphs. Zbl 1233.05137
Lortz, Roland; Mengersen, Ingrid
1
2011
Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets. Zbl 0478.05065
Harary, Frank; Harborth, Heiko; Mengersen, Ingrid
1
1981
Edges with at most one crossing in drawings of the complete graph. Zbl 0726.05035
Harborth, H.; Mengersen, I.
1
1990
Further Ramsey numbers for small complete bipartite graphs. Zbl 1141.05060
Lortz, Roland; Mengersen, Ingrid
1
2006
On the Ramsey numbers of certain graphs of order five versus all connected graphs of order six. Zbl 1306.05150
Lortz, Roland; Mengersen, Ingrid
1
2014
On the Ramsey numbers of certain graphs of order five versus all connected graphs of order six. Zbl 1306.05150
Lortz, Roland; Mengersen, Ingrid
1
2014
Ramsey numbers for small graphs versus small disconnected graphs. Zbl 1233.05137
Lortz, Roland; Mengersen, Ingrid
1
2011
Further Ramsey numbers for small complete bipartite graphs. Zbl 1141.05060
Lortz, Roland; Mengersen, Ingrid
1
2006
Off-diagonal and asymptotic results on the Ramsey number \(r(K_{2,m},K _{2,n})\). Zbl 1025.05044
Lortz, Roland; Mengersen, Ingrid
2
2003
On the Ramsey numbers \(r(K_{2,n-1},K_{2,n})\) and \(r(K_{2,n},K_{2,n})\). Zbl 1009.05101
Lortz, Roland; Mengersen, Ingrid
3
2002
Bounds on Ramsey numbers of certain complete bipartite graphs. Zbl 1009.05100
Lortz, Roland; Mengersen, Ingrid
2
2002
Ramsey numbers in octahedron graphs. Zbl 0977.05088
Harborth, Heiko; Mengersen, Ingrid
1
2001
Ramsey numbers for graphs of order four versus connected graphs of order six. Zbl 0956.05072
Hoeth, Maik; Mengersen, Ingrid
2
2000
Matching-star Ramsey sets. Zbl 0932.05063
Mengersen, Ingrid; Oeckermann, Jörg
8
1999
Size Ramsey results for paths versus stars. Zbl 0914.05053
Lortz, Roland; Mengersen, Ingrid
3
1998
Some Ramsey numbers for complete bipartite graphs. Zbl 0854.05078
Harborth, Martin; Mengersen, Ingrid
3
1996
Three color Ramsey numbers for small graphs. Zbl 0854.05077
Arste, J.; Klamroth, K.; Mengersen, I.
2
1996
The drawing Ramsey number \(\text{Dr}(K_ n)\). Zbl 0828.05026
Harborth, Heiko; Mengersen, Ingrid; Schelp, Richard H.
1
1995
Drawings of the complete graph with maximum number of crossings. Zbl 0792.05043
Harborth, Heiko; Mengersen, Ingrid
13
1992
Ramsey numbers for graph sets with fixed numbers of edges. Zbl 0794.05087
Harborth, H.; Mengersen, I.
1
1992
On Ramsey numbers of \(K_{2,n}\). Zbl 0739.05061
Exoo, Geoffrey; Harborth, Heiko; Mengersen, Ingrid
6
1991
The Ramsey number of \(K_{3,3}\). Zbl 0841.05070
Harborth, Heiko; Mengersen, Ingrid
5
1991
Edges with at most one crossing in drawings of the complete graph. Zbl 0726.05035
Harborth, H.; Mengersen, I.
1
1990
The Ramsey number of \(K_ 5-e\). Zbl 0672.05062
Clapham, C.; Exoo, G.; Harborth, H.; Mengersen, I.; Sheehan, J.
7
1989
All Ramsey numbers for five vertices and seven or eight edges. Zbl 0672.05061
Harborth, Heiko; Mengersen, Ingrid
3
1989
The Ramsey number of \(K_ 4\) versus \(K_ 5-e\). Zbl 0648.05039
Exoo, Geoffrey; Harborth, Heiko; Mengersen, Ingrid
2
1988
Eine Ramsey-Zahl für fünf Knoten und acht Kanten. Zbl 0529.05040
Harborth, Heiko; Mengersen, Ingrid
2
1984
Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets. Zbl 0478.05065
Harary, Frank; Harborth, Heiko; Mengersen, Ingrid
1
1981
Ein Extremalproblem für Matrizen aus Nullen und Einsen. Zbl 0417.05011
Harborth, Heiko; Mengersen, Ingrid
1
1979
Die Maximalzahl von kreuzungsfreien Kanten in Darstellungen von vollständigen n-geteilten Graphen. Zbl 0435.05021
Mengersen, Ingrid
1
1978
Edges without crossings in drawings of complete graphs. Zbl 0298.05108
Harborth, Heiko; Mengersen, Ingrid
2
1974

Citations by Year