scientific article

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

complexity matching cycles extremal graphs diameter packing connectivity extremal problems colourings complete subgraphs extremal graph theory Turan topological subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Related Items (only showing first 100 items - show all)

Counting ordered graphs that avoid certain subgraphs ⋮ A remark on matrix rigidity ⋮ The NIP graph of a social welfare function ⋮ Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs ⋮ Sur les graphes admettant le nombre maximum de sous-graphes à trois sommets et deux arêtes, et les paires d'ordres totaux qui maximisent \(| Rho\)- Tau\(|\). (On the graphs which admit the maximal number of subgraphs on three vertices and with two edges and the totally ordered pairs which maximize \(| Rho\)- Tau\(|)\) ⋮ On the diameter of separated point sets with many nearly equal distances ⋮ Uniquely forced perfect matching and unique 3-edge-coloring ⋮ Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs ⋮ Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree ⋮ An improved bound for the monochromatic cycle partition number ⋮ Extremal results for random discrete structures ⋮ Packing directed cycles efficiently ⋮ Spectral radii of graphs with given chromatic number ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Cubic maximal nontraceable graphs ⋮ Packing of two digraphs into a transitive tournament ⋮ On some extremal connectivity results for graphs and matroids ⋮ Eigenvalues and forbidden subgraphs. I. ⋮ Pancyclic properties of the graph of some 0-1 polyhedra ⋮ Regular subgraphs of almost regular graphs ⋮ New exact values of the maximum size of graphs free of topological complete subgraphs ⋮ Minimum degree and the minimum size of \(K_2^t\)-saturated graphs ⋮ Topological cliques of random graphs ⋮ Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs ⋮ Graphs without minor complete subgraphs ⋮ A new class of Ramsey-Turán problems ⋮ Large joints in graphs ⋮ On a conjecture on the balanced decomposition number ⋮ Distant irregularity strength of graphs ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Forcing \(k\)-repetitions in degree sequences ⋮ Extremal problems for the \(p\)-spectral radius of graphs ⋮ Perfect matchings in 4-uniform hypergraphs ⋮ Super cyclically edge connected transitive graphs ⋮ Maximizing the spectral radius of \(k\)-connected graphs with given diameter ⋮ Locally bounded coverings and factorial properties of graphs ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Low-distortion embeddings of graphs with large girth ⋮ Forbidden subgraphs in the norm graph ⋮ A data structure useful for finding Hamiltonian cycles ⋮ Completing partial packings of bipartite graphs ⋮ Implicit-degrees and circumferences ⋮ Unique graph homomorphisms onto odd cycles. II ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Cycle bases in graphs characterization, algorithms, complexity, and applications ⋮ Edge reductions in cyclically \(k\)-connected cubic graphs ⋮ Tournaments with near-linear transitive subsets ⋮ Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph ⋮ On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite ⋮ The maximum edit distance from hereditary graph properties ⋮ Regular graphs of large girth and arbitrary degree ⋮ New bounds on \(\bar{2}\)-separable codes of length 2 ⋮ Lower bounds for independence numbers of some locally sparse graphs ⋮ A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity ⋮ On embedding well-separable graphs ⋮ Disjoint unions of complete minors ⋮ Generalizing vertex pancyclic and \(k\)-ordered graphs ⋮ On saturation games ⋮ Monochromatic bounded degree subgraph partitions ⋮ Independent sets in graphs ⋮ Extremality of degree-based graph entropies ⋮ Near packings of two graphs ⋮ The total chromatic number of graphs having large maximum degree ⋮ Excluding induced subgraphs. II: Extremal graphs ⋮ On the calculation of transitive reduction-closure of orders ⋮ Bounded vertex colorings of graphs ⋮ Query strategies for priced information ⋮ A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs ⋮ On the complexity of fixed parameter clique and dominating set ⋮ Vertex-disjoint quadrilaterals in graphs ⋮ Girth and treewidth ⋮ Approximating \(k\)-spanner problems for \(k>2\) ⋮ On the Ramsey numbers for stars versus complete graphs ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ The binding number of a graph and its pancyclism ⋮ Optimal parallel algorithms on planar graphs ⋮ The \((k,\ell )\)-proper index of graphs ⋮ Diameter graphs in \({\mathbb R}^4\) ⋮ On an extremal hypergraph problem related to combinatorial batch codes ⋮ The Turán number of sparse spanning graphs ⋮ More on the power of chain rules in context-free grammars ⋮ The structure of social decision functions ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes ⋮ Stability results on the circumference of a graph ⋮ Recent trends in combinatorial optimization ⋮ Combinatorial dimension and random sets ⋮ Lower bounds for the clique and the chromatic numbers of a graph ⋮ An edge extremal result for subcohesion ⋮ Graph decompositions without isolates ⋮ Girth in graphs ⋮ A generalization of the Bondy-Chvátal theorem on the k-closure ⋮ Embedding of \(\ell^ k_{\infty}\) in finite dimensional Banach spaces ⋮ Geometrical solution of an intersection problem for two hypergraphs ⋮ The behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal ⋮ How to make a graph bipartite ⋮ Extremal problems whose solutions are the blowups of the small Witt- designs ⋮ New lower bound techniques for distributed leader finding and other problems on rings of processors ⋮ The structure of the models of decidable monadic theories of graphs ⋮ Low dimensional embeddings of doubling metrics ⋮ Decomposing oriented graphs into transitive tournaments

This page was built for publication: