scientific article; zbMATH DE number 863492
From MaRDI portal
Publication:4871771
zbMath0844.05054MaRDI QIDQ4871771
Publication date: 18 August 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (43)
The branching random walk and contact process on Galton-Watson and nonhomogeneous trees ⋮ On finding common neighborhoods in massive graphs. ⋮ A Five-Color Theorem for Graphs on Surfaces ⋮ Counting Hamilton cycles in Dirac hypergraphs ⋮ On the Ramsey Property of Families of Graphs ⋮ Vertex ordering and partitioning problems for random spatial graphs. ⋮ Quasi-Random Set Systems ⋮ Smale Flows on the Three-Sphere ⋮ Measures of Graphs on the Reals ⋮ Matroid representation of clique complexes ⋮ Small cores in 3-uniform hypergraphs ⋮ Minimum degree and the minimum size of \(K_2^t\)-saturated graphs ⋮ Unnamed Item ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ How to Frame a Mathematician ⋮ A new series of dense graphs of high girth ⋮ On Connectivity in Matroids and Graphs ⋮ Extremal Numbers for Odd Cycles ⋮ The Turán number of directed paths and oriented cycles ⋮ Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences ⋮ Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ 0-1 matrices with zero trace whose squares are 0-1 matrices ⋮ A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints ⋮ A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs ⋮ Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries ⋮ Paths and Cycles in Tournaments ⋮ The word and geodesic problems in free solvable groups ⋮ Algorithmic Solution of Extremal Digraph Problems ⋮ Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints ⋮ On the maximum number of cliques in a graph ⋮ Law of large numbers for the maximal flow through a domain of $\mathbb{R}^{d}$ in first passage percolation ⋮ Ramanujan graphs and Hecke operators ⋮ Extremal digraphs avoiding an orientation of \(C_4\) ⋮ Unnamed Item ⋮ Geometry of Riemann surfaces based on closed geodesics ⋮ Large graphs with given degree and diameter. II ⋮ High-girth graphs avoiding a minor are nearly bipartite ⋮ Closed Sets Without Measurable Matching ⋮ On the intersections of systems of curves ⋮ The May-Wigner stability theorem for connected matrices ⋮ Standard realizations of crystal lattices via harmonic maps ⋮ Almost-spanning subgraphs with bounded degree in dense graphs
This page was built for publication:
