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
Isomorphism Testing for Graphs Excluding Small Minors, Polytopes, graphs, and complexes, Simplicial homeomorphs and trace-bounded hypergraphs, Disjoint isomorphic balanced clique subdivisions, Classifying intrinsically linked tournaments by score sequence, Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth, On the extremal function for graph minors, Subdivisions of maximal 3‐degenerate graphs of order d+1 $d+1$ in graphs of minimum degree d $d$, Modularity of minor‐free graphs, Rainbow clique subdivisions, A graph minor condition for graphs to be \(k\)-linked, Balanced Subdivisions of a Large Clique in Graphs with High Average Degree, A solution to Erdős and Hajnal’s odd cycle problem, How to build a pillar: a proof of Thomassen's conjecture, Subdivisions with congruence constraints in digraphs of large chromatic number, Treewidth, Circle Graphs, and Circular Drawings, Recent progress towards Hadwiger's conjecture, Rainbow subdivisions of cliques, The spectral radius of minor-free graphs, Über endliche Graphen mit vorgegebenen Homomorphieeigenschaften. (On finite graphs with prescribed homotopy properties), Online Node-weighted Steiner Forest and Extensions via Disk Paintings, The communication complexity of enumeration, elimination, and selection, Graph theory, On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion, Connectivity for Kite-Linked Graphs, Extremal functions for sparse minors, On 1-subdivisions of transitive tournaments, On the critical densities of minor-closed classes, Even cycles in directed graphs, Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems, The monadic second order logic of graphs. VI: On several representations of graphs by relational structures, Linkage for the diamond and the path with four vertices, Disjoint complete minors and bipartite minors, Immersion of transitive tournaments in digraphs with large minimum outdegree, Cycles of Given Size in a Dense Graph, Small complete minors above the extremal edge density, Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs, A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes, Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids, Graph decomposition with constraints in the minimum degree, Short proofs of some extremal results. II., On well-quasi-ordering-finite graphs by immersion, On zeros of the characteristic polynomial of matroids of bounded tree-width, Existence of vertices of local connectivity \(k\) in digraphs of large outdegree, On the Hadwiger's conjecture for graph products, Intrinsically knotted and 4-linked directed graphs, On the number of cliques in graphs with a forbidden minor, New exact values of the maximum size of graphs free of topological complete subgraphs, Layered separators in minor-closed graph classes with applications, Topological Cliques in Graphs, Linking four vertices in graphs of large connectivity, Complete acyclic colorings, The edge-density for \(K_{2,t}\) minors, A lower bound on the average degree forcing a minor, Cliques in dense GF(\(q\))-representable matroids, Rumor Spreading with No Dependence on Conductance, Optimal connectivity for fat-triangle linkages, Network bargaining: using approximate blocking sets to stabilize unstable instances, Small minors in dense graphs, The extremal function for unbalanced bipartite minors, Graph theory. Abstracts from the workshop held January 2--8, 2022, Forcing a sparse minor, Kempe classes and the Hadwiger conjecture, Rainbow Turán number of clique subdivisions, On the combinatorial problems which I would most like to see solved, The saga of minimum spanning trees, On the purity of minor-closed classes of graphs, Topological cliques in graphs II, Subdivisions of digraphs in tournaments, Polynomial treewidth forces a large grid-like-minor, Highly linked tournaments, On end degrees and infinite cycles in locally finite graphs, Disjoint unions of complete minors, On \(K_{s,t}\)-minors in graphs with given average degree, Extremal spectral radius of \(K_{3,3}/K_{2,4}\)-minor free graphs, Compact topological minors in graphs, Independent sets in graphs, The extremal function for 3-linked graphs, An advance in infinite graph models for the analysis of transportation networks, The extremal functions of classes of matroids of bounded branch-width, Complexity of Grundy coloring and its variants, The extremal function and Colin de Verdière graph parameter, The Colin de Verdière parameter, excluded minors, and the spectral radius, On \(K_{s,t}\)-minors in graphs with given average degree. II, Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries, Logarithmically small minors and topological minors, Linkability in iterated line graphs, On the structure of \(k\)-connected graphs without \(K_{k}\)-minor, An improved linear edge bound for graph linkages, Forcing unbalanced complete bipartite minors, Automorphism groups of graphs and edge-contraction, Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs, Dense graphs have \(K_{3,t}\) minors, Locally finite graphs with ends: A topological approach. II: Applications, Automorphism groups of graphs and edge-contraction. (Reprint), S-functions for graphs, Single source shortest paths in \(H\)-minor free graphs, Small cocircuits in matroids, On the discrepancy between two Zagreb indices, The Erdös-Pósa property for matroid circuits, The Extremal Number of the Subdivisions of the Complete Bipartite Graph, Semi-topological subgraphs, Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density, A universal exponent for homeomorphs, Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl, Homomorphiesätze für Graphen, Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen, Hadwiger’s Conjecture, Wohlquasigeordnete Klassen endlicher Graphen, Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation, Subdivisions in digraphs of large out-degree or large dichromatic number, Minimum degree condition for a graph to be knitted, Highly linked graphs, The extremal number of longer subdivisions, Cliques, minors and apex graphs, Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs, Highly linked tournaments with large minimum out-degree, Subdivisions of transitive tournaments, Cuts and bounds, The extremal function for complete minors, High-girth graphs avoiding a minor are nearly bipartite, Rooted topological minors on four vertices, Extremal connectivity for topological cliques in bipartite graphs, The highly connected matroids in minor-closed classes, Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision, Average degree conditions forcing a minor
Cites Work
