# Homomorphieeigenschaften und mittlere Kantendichte von Graphen

@article{Mader1967HomomorphieeigenschaftenUM,
title={Homomorphieeigenschaften und mittlere Kantendichte von Graphen},
journal={Mathematische Annalen},
year={1967},
volume={174},
pages={265-268}
}
• Published 1967
• Mathematics
• Mathematische Annalen
245 Citations
Cliques in dense GF(q)-representable matroids
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2003
We prove that, for any finite field F and positive integer n, there exists an integer λ such that if M is a simple F-representable matroid with no M(Kn)-minor, then |E(M)|≥λr(M).
Highly linked tournaments with large minimum out-degree
• Mathematics, Computer Science
• J. Comb. Theory, Ser. B
• 2019
We prove that there exists a function $f:\mathbb{N} \rightarrow \mathbb{N}$ such that for any positive integer $k$, if $T$ is a strongly $4k$-connected tournament with minimum out-degree at leastExpand
• Physics
• 2011
Resumo: o numero de cocircuitos disjuntos em uma matroide e delimitado pelo seu posto. Existem, no entanto, matroides de posto arbitrariamente grande que nao contem dois cocircuitos disjuntos.Expand
C O ] 2 5 M ay 2 01 6 A proof of Mader ’ s conjecture on large clique subdivisions in C 4-free graphs
• 2021
Given any integers s, t ≥ 2, we show there exists some c = c(s, t) > 0 such that any Ks,t-free graph with average degree d contains a subdivision of a clique with at least cd 1 2 s s−1 vertices. InExpand
Subdivisions of maximal 3-degenerate graphs of order $d+1$ in graphs of minimum degree $d$
We prove that every graph of minimum degree at least $d \ge 1$ contains a subdivision of some maximal 3-degenerate graph of order $d+1$. This generalizes the classic results of Dirac ($d=3$) andExpand
C O ] 2 1 Ju n 20 19 FAT-TRIANGLE LINKAGE AND KITE-LINKED GRAPHS
• 2019
For a multigraph H, a graph G is H-linked if every injective mapping φ : V (H) → V (G) can be extended to an H-subdivision in G. We study the minimum connectivity required for a graph to be Hlinked.Expand
• Mathematics
• 2019
For a multigraph $H$, a graph $G$ is $H$-linked if every injective mapping $\phi: V(H)\to V(G)$ can be extended to an $H$-subdivision in $G$. We study the minimum connectivity required for a graph toExpand
On the critical densities of minor-closed classes
• Mathematics, Computer Science
• Eur. J. Comb.
• 2019
The small values in B are determined (those up to 2); it is shown that $B$ is `asymptotically dense'; and some questions posed by Eppstein are answered. Expand
A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
• Mathematics, Computer Science
• J. Lond. Math. Soc.
• 2017
It is shown there exists some c=c(s,t)>0 such that any K_{s, t}-free graph with average degree d contains a subdivision of a clique with at least $cd^{\frac{1}{2}\frac{s}{s-1}}$ vertices. Expand
The Erdös-Pósa property for matroid circuits
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2009
It is proved that for each k and n there exists a constant c such that, if M is a matroid with rank at least c, then either M has k disjoint cocircuits or M contains a U"n","2"n-, M(K"n)-, or B(K'n)-minor. Expand

#### References

SHOWING 1-3 OF 3 REFERENCES