Paths in graphs

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

• scientific article; zbMATH DE number 2188355
• On the Number of 4-Edge Paths in Graphs With Given Edge Density
• Paths of length four
• scientific article; zbMATH DE number 568796
• On the number of paths and cycles for almost all graphs and digraphs

zbMATH Keywords

maximal number of paths of lengths \(s\) in a graph with \(m\) edgesmaximal number of subgraphs isomorphic to a given graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

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 scale-free graph model based on bipartite graphs
• Expander properties and the cover time of random intersection graphs
• Asymptotic behaviour of estimates of link probability in random networks
• Bounded quantifier depth spectra for random graphs
• On the zero-one \(k\)-law extensions
• Networks of random trees as a model of neuronal connectivity
• Zero-one \(k\)-law
• Conflict and error prevention and detection in complex networks
• Asymptotic probabilities of extension properties and random \(l\)-colourable structures
• A likelihood-ratio type test for stochastic block models with bounded degrees
• Sparse partition universal graphs for graphs of bounded degree
• Codes identifying sets of vertices in random networks
• Characterisations and examples of graph classes with bounded expansion
• Path Ramsey number for random graphs
• An approximate version of Sumner's universal tournament conjecture
• On the average-case complexity of parameterized clique
• Component structure of the configuration model: barely supercritical case
• Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
• Jamming in complex networks with degree correlation
• Anti-Ramsey properties of random graphs
• Spreading messages
• Singular value decomposition of large random matrices (for two-way classification of microarrays)
• Small subgraphs in random graphs and the power of multiple choices
• Some colouring problems for Paley graphs
• Epidemic models on social networks—With inference
• Limiting probabilities of first order properties of random sparse graphs and hypergraphs
• The component structure of dense random subgraphs of the hypercube
• Random walk on the random connection model
• Thresholding random geometric graph properties motivated by ad hoc sensor networks
• Diffusion and cascading behavior in random networks
• Cores of random \(r\)-partite hypergraphs
• A note on competitive diffusion through social networks
• Globally exponential synchronization in an array of asymmetric coupled neural networks
• Phase transitions and percolation at criticality in enhanced random connection models
• Balanced allocation and dictionaries with tightly packed constant size bins
• Exact enumeration of satisfiable 2-SAT formulae
• \(q\)-random walks on \(\mathbb Z^d\), \(d = 1, 2, 3\)
• Partially dynamic efficient algorithms for distributed shortest paths
• Dense subgraphs in random graphs
• Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022
• An alternative proof of the linearity of the size-Ramsey number of paths
• Independent sets in graphs
• On certain connectivity properties of the internet topology
• Some geometric and dynamical properties of the Urysohn space
• Title not available (Why is that?)
• Manipulative waiters with probabilistic intuition
• Broadcasting in dynamic radio networks
• On spanning structures in random hypergraphs
• Triangles in random cubic planar graphs
• The union-closed sets conjecture almost holds for almost all random bipartite graphs

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)