scientific article
From MaRDI portal
Publication:3312262
zbMath0531.05037MaRDI QIDQ3312262
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items (37)
Large generalized books are \(p\)-good ⋮ Inequalities in probability theory and turán-type problems for graphs with colored vertices ⋮ Problems and results in discrete mathematics ⋮ Explicit construction of graphs with an arbitrary large girth and of large size ⋮ On product representation of powers. I ⋮ Extremal Graph Problems for Graphs with a Color-Critical Vertex ⋮ Extremal theory and bipartite graph-tree Ramsey numbers ⋮ On invariants of hereditary graph properties ⋮ Zero-sum problems -- a survey ⋮ On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs ⋮ A new series of dense graphs of high girth ⋮ Fractional products of sets ⋮ On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition ⋮ Ramsey numbers involving large dense graphs and bipartite Turán numbers ⋮ On the comparison of cryptographical properties of two different families of graphs with large cycle indicator ⋮ Topological minors in bipartite graphs ⋮ The implementation of cubic public keys based on a new family of algebraic graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite ⋮ On monomial graphs of girth eight ⋮ Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded ⋮ Paul Erdős, 1913-1996 ⋮ Turán theorems with repeated degrees ⋮ Excluding induced subgraphs. II: Extremal graphs ⋮ New families of graphs without short cycles and large size ⋮ On lower bounds for the chromatic number in terms of vertex degree ⋮ Algorithmic Solution of Extremal Digraph Problems ⋮ Cut and pendant vertices and the number of connected induced subgraphs of a graph ⋮ On the homogeneous algebraic graphs of large girth and their applications ⋮ Extremal problems for sets forming Boolean algebras and complete partite hypergraphs ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) ⋮ The number of graphs without forbidden subgraphs ⋮ Polarities and \(2k\)-cycle-free graphs ⋮ On Extremal Graphs with Bounded Girth ⋮ A hierarchy of randomness for graphs ⋮ Extremal problems whose solutions are the blowups of the small Witt- designs ⋮ Extremal problems and generalized degrees
This page was built for publication:
