On the edit distance function of the random graph
From MaRDI portal
Recommendations
Cites work
- An introduction to the theory of graph spectra
- Boundedness of optimal matrices in extremal multigraph and digraph problems
- Edit distance and its computation
- Extremal graphs and multigraphs with two weighted colours
- Graphs, colours, weights and hereditary properties
- scientific article; zbMATH DE number 3825706 (Why is no real title available?)
- Large networks and graph limits
- Spectra of graphs
- The chromatic number of random graphs
- The edit distance in graphs: methods, results, and generalizations
- The maximum edit distance from hereditary graph properties
- The structure of hereditary properties and colourings of random graphs
- What is the furthest graph from a hereditary property?
Cited in
(8)- Accumulation points of the edit distance function
- The edit distance function of some graphs
- On the edit distance of powers of cycles
- Deviation estimates for Eulerian edit numbers of random graphs
- What is the furthest graph from a hereditary property?
- Stability-type results for hereditary properties
- ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
- The maximum edit distance from hereditary graph properties
This page was built for publication: On the edit distance function of the random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886325)