scientific article; zbMATH DE number 863492
From MaRDI portal
Publication:4871771
zbMATH Open0844.05054MaRDI QIDQ4871771FDOQ4871771
Authors: Béla Bollobás
Publication date: 18 August 1996
Title of this publication is not available (Why is that?)
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (57)
- Approximating long cycle above Dirac's guarantee
- How to Frame a Mathematician
- The extremal graphs with respect to their nullity
- Title not available (Why is that?)
- On Connectivity in Matroids and Graphs
- The extreme set condition of a graph
- Almost-spanning subgraphs with bounded degree in dense graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- A new series of dense graphs of high girth
- 0-1 matrices with zero trace whose squares are 0-1 matrices
- Standard realizations of crystal lattices via harmonic maps
- On finding common neighborhoods in massive graphs.
- Title not available (Why is that?)
- Algorithmic Solution of Extremal Digraph Problems
- Title not available (Why is that?)
- Vertex ordering and partitioning problems for random spatial graphs.
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs
- Extremal digraphs avoiding an orientation of \(C_4\)
- Law of large numbers for the maximal flow through a domain of \(\mathbb R^d\) in first passage percolation
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- The May-Wigner stability theorem for connected matrices
- Minimum degree and the minimum size of \(K_2^t\)-saturated graphs
- EXTREMAL THEORY OF ORDERED GRAPHS
- Extremal theory of vertex or edge ordered graphs
- Closed Sets Without Measurable Matching
- Matroid representation of clique complexes
- Selected Topics in the Extremal Graph Theory
- On the intersections of systems of curves
- Geometry of Riemann surfaces based on closed geodesics
- The word and geodesic problems in free solvable groups.
- Title not available (Why is that?)
- Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
- On the Ramsey Property of Families of Graphs
- On the maximum number of cliques in a graph
- Title not available (Why is that?)
- Measures of Graphs on the Reals
- Small cores in 3-uniform hypergraphs
- Large graphs with given degree and diameter. II
- Paths and Cycles in Tournaments
- The branching random walk and contact process on Galton-Watson and nonhomogeneous trees
- Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
- High-girth graphs avoiding a minor are nearly bipartite
- Title not available (Why is that?)
- Smale Flows on the Three-Sphere
- Extremal graph theory and finite forcibility
- A Five-Color Theorem for Graphs on Surfaces
- The Turán number of directed paths and oriented cycles
- Ramanujan graphs and Hecke operators
- Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries
- Acquisition-extremal graphs
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Title not available (Why is that?)
- Quasi-Random Set Systems
- Extremal numbers for odd cycles
- Counting Hamilton cycles in Dirac hypergraphs
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871771)