Paths in graphs
From MaRDI portal
Publication:4780288
DOI10.1556/SScMath.38.2001.1-4.8zbMath0997.05049MaRDI QIDQ4780288
Publication date: 3 November 2002
Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)
maximal number of paths of lengths \(s\) in a graph with \(m\) edges; maximal number of subgraphs isomorphic to a given graph
Related Items
Interpolating between bounds on the independence number, Some colouring problems for Paley graphs, 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, An improved algorithm for approximating the chromatic number of \(G_{n,p}\), When is a random graph projective?, Graph factors and factorization: 1985--2003: a survey, The neighborhood complex of a random graph, Codes identifying sets of vertices in random networks, On the asymptotic number of inequivalent binary self-dual codes, The evolution of genetic topologies, Expansion properties of a random regular graph after random vertex deletions, Some geometric and dynamical properties of the Urysohn space, Large independent sets in general random intersection graphs, A randomized algorithm for the joining protocol in dynamic distributed networks, Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums, Anti-Ramsey properties of random graphs, Coarse-grained bifurcation analysis and detection of criticalities of an individual-based epidemiological network model with infection control, Average-case analysis of incremental topological ordering, Maintaining dynamic minimum spanning trees: an experimental study, Variance of the subgraph count for sparse Erdős-Rényi graphs, The Laplacian energy of random graphs, Expected values of parameters associated with the minimum rank of a graph, Stochastic epidemic models: a survey, Thresholding random geometric graph properties motivated by ad hoc sensor networks, Understanding the scalability of Bayesian network inference using clique tree growth curves, A note on competitive diffusion through social networks, Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems, Block-diagonal semidefinite programming hierarchies for 0/1 programming, The degree sequences of an asymmetrical growing network, Broadcasting in dynamic radio networks, Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters, Topology of random clique complexes, A note on the chromatic number of a dense random graph, A scale-free graph model based on bipartite graphs, Spreading messages, Expander properties and the cover time of random intersection graphs, Random regular graphs of non-constant degree: concentration of the chromatic number, The evolution of the min-min random graph process, Connectivity of the uniform random intersection graph, On a random graph evolving by degrees, Singular value decomposition of large random matrices (for two-way classification of microarrays), Directed cycles and related structures in random graphs. I: Static properties, Paths of length four, A decomposability index in logical analysis of data, Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence, Traceability codes, Partially dynamic efficient algorithms for distributed shortest paths, Resilience and reliability analysis of P2P network systems, Local heuristics and the emergence of spanning subgraphs in complex networks, Balanced allocation and dictionaries with tightly packed constant size bins, Bounds on the bisection width for random \(d\)-regular graphs, Synchronization in random networks with given expected degree sequences, Fractionally total colouring \(G_{n,p}\), On certain connectivity properties of the internet topology, Fast winning strategies in maker-breaker games, The critical point of \(k\)-clique percolation in the Erdős-Rényi graph, Shareholding Networks and Centrality: An Application to the Italian Financial Market
