Homomorphieeigenschaften und mittlere Kantendichte von Graphen
From MaRDI portal
Publication:2531599
DOI10.1007/BF01364272zbMath0171.22405WikidataQ56235111 ScholiaQ56235111MaRDI QIDQ2531599
Publication date: 1967
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/161642
Related Items
Topological Cliques in Graphs, Topological cliques in graphs II, A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes, Polytopes, graphs, and complexes, The communication complexity of enumeration, elimination, and selection, Graph theory, Über endliche Graphen mit vorgegebenen Homomorphieeigenschaften. (On finite graphs with prescribed homotopy properties), Forcing unbalanced complete bipartite minors, On the Hadwiger's conjecture for graph products, New exact values of the maximum size of graphs free of topological complete subgraphs, Disjoint unions of complete minors, On \(K_{s,t}\)-minors in graphs with given average degree, The extremal function for 3-linked graphs, The Erdös-Pósa property for matroid circuits, Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density, Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation, Even cycles in directed graphs, Graph decomposition with constraints in the minimum degree, On well-quasi-ordering-finite graphs by immersion, Kempe classes and the Hadwiger conjecture, On the combinatorial problems which I would most like to see solved, S-functions for graphs, Semi-topological subgraphs, The monadic second order logic of graphs. VI: On several representations of graphs by relational structures, Cliques in dense GF(\(q\))-representable matroids, The extremal function for unbalanced bipartite minors, Subdivisions of transitive tournaments, On the structure of \(k\)-connected graphs without \(K_{k}\)-minor, An improved linear edge bound for graph linkages, The extremal function for complete minors, High-girth graphs avoiding a minor are nearly bipartite, Existence of vertices of local connectivity \(k\) in digraphs of large outdegree, Automorphism groups of graphs and edge-contraction, Disjoint complete minors and bipartite minors, Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids, On end degrees and infinite cycles in locally finite graphs, Linkability in iterated line graphs, Automorphism groups of graphs and edge-contraction. (Reprint), Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl, Homomorphiesätze für Graphen, Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen, Wohlquasigeordnete Klassen endlicher Graphen, Highly linked graphs, Cuts and bounds, Extremal connectivity for topological cliques in bipartite graphs, Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries
Cites Work
