The following pages link to Homomorphiesätze für Graphen (Q2530192):
Displayed 50 items.
- Average degree conditions forcing a minor (Q259170) (← links)
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- Small complete minors above the extremal edge density (Q313429) (← links)
- Random graphs from a weighted minor-closed class (Q396764) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Small minors in dense graphs (Q427808) (← links)
- Ramsey numbers of cubes versus cliques (Q519968) (← links)
- The edge-density for \(K_{2,t}\) minors (Q618032) (← links)
- Lower bound of the Hadwiger number of graphs by their average degree (Q760439) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Graphs without minor complete subgraphs (Q878614) (← links)
- Detecting minors in matroids through triangles (Q901153) (← links)
- Disjoint unions of complete minors (Q941374) (← links)
- On embeddability and stresses of graphs (Q950325) (← links)
- Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density (Q1011746) (← links)
- Hadwiger number and the Cartesian product of graphs (Q1014821) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Cliques, minors and apex graphs (Q1043579) (← links)
- On the maximum density of graphs which have no subcontraction to \(K^ r\). (Q1053033) (← links)
- On the edge numbers of graphs with Hadwiger number 4 and 5 (Q1055783) (← links)
- On a relationship between Hadwiger and stability numbers (Q1092928) (← links)
- Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs (Q1119593) (← links)
- Forbidden graphs for degree and neighbourhood conditions (Q1119603) (← links)
- The isomorphism problem for classes of graphs closed under contraction (Q1175965) (← links)
- Hadwiger's conjecture for \(K_ 6\)-free graphs (Q1311018) (← links)
- Tournaments as strong subcontractions (Q1377688) (← links)
- The extremal functions for triangle-free graphs with excluded minors (Q1621057) (← links)
- On the critical densities of minor-closed classes (Q1621066) (← links)
- On the purity of minor-closed classes of graphs (Q1719590) (← links)
- On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space (Q1745202) (← links)
- The extremal function for Petersen minors (Q1748273) (← links)
- The extremal function and Colin de Verdière graph parameter (Q1753124) (← links)
- Disjoint \(K_{r}\)-minors in large graphs with given average degree (Q1767620) (← links)
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor (Q1767621) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
- The extremal function for complete minors (Q1850528) (← links)
- Zero-sum problems -- a survey (Q1917486) (← links)
- The Colin de Verdière parameter, excluded minors, and the spectral radius (Q2000642) (← links)
- Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors (Q2036707) (← links)
- Some remarks on even-hole-free graphs (Q2161221) (← links)
- Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait (Q2171018) (← links)
- A lower bound on the average degree forcing a minor (Q2189420) (← links)
- Asymptotic density of graphs excluding disconnected minors (Q2221924) (← links)
- Non-separating planar graphs (Q2223464) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- The extremal function for disconnected minors (Q2399354) (← links)
- On the number of cliques in graphs with a forbidden minor (Q2399355) (← links)
- \(K_7\)-minors in optimal 1-planar graphs (Q2400554) (← links)