Paths in graphs
From MaRDI portal
Publication:4780288
DOI10.1556/SSCMATH.38.2001.1-4.8zbMATH Open0997.05049OpenAlexW2093889116MaRDI QIDQ4780288FDOQ4780288
Authors: Béla Bollobás, Amites Sarkar 
Publication date: 3 November 2002
Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1556/sscmath.38.2001.1-4.8
Recommendations
maximal number of paths of lengths \(s\) in a graph with \(m\) edgesmaximal number of subgraphs isomorphic to a given graph
Cited In (only showing first 100 items - show all)
- PageRank on inhomogeneous random digraphs
- Directed cycles and related structures in random graphs. I: Static properties
- Best response dynamics on random graphs
- Clustering coefficients of large networks
- On the maximum number of copies of H in graphs with given size and order
- Typical and generic ranks in matrix completion
- Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves
- Modeling systemic risk with Markov switching graphical SUR models
- Counting extensions revisited
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Existential monadic second order convergence law fails on sparse random graphs
- Maximum sparse induced subgraphs of the binomial random graph with given number of edges
- Goldberg's conjecture is true for random multigraphs
- Competition for the access to and use of information in networks
- Critical window for connectivity in the configuration model
- Planting colourings silently
- Epidemic random network simulations in a distributed computing environment
- Understanding the scalability of Bayesian network inference using clique tree growth curves
- The threshold probability for long cycles
- Monadic second-order properties of very sparse random graphs
- Localization game for random graphs
- Bipartite and directed scale-free complex networks arising from zeta functions
- Symmetric graph properties have independent edges
- Results on the Wiener profile
- The asymptotic value of energy for matrices with degree-distance-based entries of random graphs
- The degree sequences of an asymmetrical growing network
- Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
- Generating hierarchial scale-free graphs from fractals
- Last passage percolation on the complete graph
- On the chromatic number of the preferential attachment graph
- Strong identification codes for graphs
- Information spreading in dynamic networks: an analytical approach
- On the edge set of graphs of lattice paths
- Geometry of the minimal spanning tree of a random 3-regular graph
- On the limiting distribution of the metric dimension for random forests
- The stability of conventions: random and lattice matching networks compared
- A note on the chromatic number of a dense random graph
- Mixed connectivity properties of random graphs and some special graphs
- The number of satisfying assignments of random regular \(k\)-SAT formulas
- Geodesic cycles in random graphs
- Conflict-free connection number of random graphs
- Title not available (Why is that?)
- The evolution of the min-min random graph process
- Title not available (Why is that?)
- \(\mathcal{H}_\infty\) network optimization for edge consensus
- Diameter in ultra-small scale-free random graphs
- Avoidable paths in graphs
- Size-Ramsey numbers of cycles versus a path
- A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph
- A decomposability index in logical analysis of data
- A randomized algorithm for the joining protocol in dynamic distributed networks
- Networks beyond pairwise interactions: structure and dynamics
- Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence
- Paths through K-specified edges in a linear graph
- Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
- Statistical physics approaches to the complex Earth system
- Title not available (Why is that?)
- Maintaining dynamic minimum spanning trees: an experimental study
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability
- On Bollobás‐Riordan random pairing model of preferential attachment graph
- The small world effect on the coalescing time of random walks
- Path hitting in acyclic graphs
- Search for an immobile hider on a stochastic network
- An improved algorithm for approximating the chromatic number of \(G_{n,p}\)
- Interpolating between bounds on the independence number
- Successive minimum spanning trees
- Edge-colouring graphs with bounded local degree sums
- Variance of the subgraph count for sparse Erdős-Rényi graphs
- Percolation on complex networks: theory and application
- When is a random graph projective?
- On the generalized Wiener polarity index of trees with a given diameter
- Paths of length four
- Discrimination through versioning with advertising in social networks
- Coarse-grained bifurcation analysis and detection of criticalities of an individual-based epidemiological network model with infection control
- The asymptotic value of the Randić index for trees
- Typical distances in a geometric model for complex networks
- A comparative power analysis of the maximum degree and size invariants for random graph inference
- Hodge-Kodaira decomposition of evolving neural networks
- Algebraic and topological indices of molecular pathway networks in human cancers
- On the asymptotic number of inequivalent binary self-dual codes
- On the Number of 4-Edge Paths in Graphs With Given Edge Density
- Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
- Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example
- On the number of alternating paths in random graphs
- Random regular graphs of non-constant degree: concentration of the chromatic number
- Optimal stopping in a search for a vertex with full degree in a random graph
- Title not available (Why is that?)
- Path problems in networks
- The neighborhood complex of a random graph
- The critical point of \(k\)-clique percolation in the Erdős-Rényi graph
- Average update times for fully-dynamic all-pairs shortest paths
- On the clique-game
- Note on matching preclusion number of random graphs
- ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
- The evolution of genetic topologies
- Expansion properties of a random regular graph after random vertex deletions
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
- On a random graph evolving by degrees
- Gibbs random graphs on point processes
This page was built for publication: Paths in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780288)
