Paths in graphs
From MaRDI portal
Publication:4780288
DOI10.1556/SScMath.38.2001.1-4.8zbMath0997.05049OpenAlexW2093889116MaRDI QIDQ4780288
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
maximal number of paths of lengths \(s\) in a graph with \(m\) edgesmaximal number of subgraphs isomorphic to a given graph
Related Items
Bounded quantifier depth spectra for random graphs, Paths of length four, Networks beyond pairwise interactions: structure and dynamics, A decomposability index in logical analysis of data, Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle, 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}\), Symmetric graph properties have independent edges, Triangles in random cubic planar graphs, On spanning structures in random hypergraphs, Results on the Wiener profile, The union-closed sets conjecture almost holds for almost all random bipartite graphs, Uniform sampling of directed and undirected graphs conditional on vertex connectivity, When is a random graph projective?, On the zero-one \(k\)-law extensions, Graph factors and factorization: 1985--2003: a survey, The neighborhood complex of a random graph, Codes identifying sets of vertices in random networks, Consensus of noisy multiagent systems with Markovian switching topologies and time-varying delays, On the asymptotic number of inequivalent binary self-dual codes, A comparative power analysis of the maximum degree and size invariants for random graph inference, The stability of conventions: random and lattice matching networks compared, The evolution of genetic topologies, Hodge-Kodaira decomposition of evolving neural networks, Asymptotic behaviour of estimates of link probability in random networks, Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs, Analysis of an iterated local search algorithm for vertex cover in sparse random graphs, Jamming in complex networks with degree correlation, Some results on approximate 1-median selection in metric spaces, Zero-one \(k\)-law, Diffusion and cascading behavior in random networks, Sparse partition universal graphs for graphs of bounded degree, Cores of random \(r\)-partite hypergraphs, Stable network topologies using the notion of covering, The adjacent vertex distinguishing total chromatic number, Geodesic cycles in random graphs, Conflict and error prevention and detection in complex networks, Average update times for fully-dynamic all-pairs shortest paths, Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence, Traceability codes, The large deviation principle for the Erdős-Rényi random graph, On the clique-game, Identifying stable network structures and sets of key players using a \(W\)-covering perspective, An approximate version of Sumner's universal tournament conjecture, Expansion properties of a random regular graph after random vertex deletions, Characterisations and examples of graph classes with bounded expansion, Some geometric and dynamical properties of the Urysohn space, Modeling systemic risk with Markov switching graphical SUR models, On sets of integers with restrictions on their products, Dense subgraphs in random graphs, Independent sets in graphs, PageRank on inhomogeneous random digraphs, Tropical dominating sets in vertex-coloured graphs, Competition for the access to and use of information in networks, 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, On the generalized Wiener polarity index of trees with a given diameter, Size-Ramsey numbers of cycles versus a path, Incremental single-source shortest paths in digraphs with arbitrary positive arc weights, Anti-Ramsey properties of random graphs, Small subgraphs in random graphs and the power of multiple choices, 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, Last passage percolation on the complete graph, The small world effect on the coalescing time of random walks, The Laplacian energy of random graphs, Expected values of parameters associated with the minimum rank of a graph, Existential monadic second order convergence law fails on sparse random graphs, The asymptotic value of the Randić index for trees, Stochastic epidemic models: a survey, Interpolating between bounds on the independence number, Globally exponential synchronization in an array of asymmetric coupled neural networks, 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, Algebraic and topological indices of molecular pathway networks in human cancers, 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, Asymptotic probabilities of extension properties and random \(l\)-colourable structures, Optimal stopping in a search for a vertex with full degree in a random graph, 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, Note on matching preclusion number of random graphs, 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, Some colouring problems for Paley graphs, Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves, On the maximum number of copies of H in graphs with given size and order, Epidemic models on social networks—With inference, Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey, On Bollobás‐Riordan random pairing model of preferential attachment graph, The component structure of dense random subgraphs of the hypercube, Avoidance couplings on non‐complete graphs, The size‐Ramsey number of short subdivisions, A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph, Limiting probabilities of first order properties of random sparse graphs and hypergraphs, Counting extensions revisited, Successive minimum spanning trees, Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions, Slightly supercritical percolation on non‐amenable graphs I: The distribution of finite clusters, Haystack hunting hints and locker room communication, Site percolation on pseudo‐random graphs, Down‐set thresholds, ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs, Parameter estimation in a 3‐parameter p‐star random graph model, Irreducible nonmetrizable path systems in graphs, A variant of the Erdős–Rényi random graph process, Contagion dynamics on a compound model, Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022, The birth of the strong components, Sharp threshold for rigidity of random graphs, Exact enumeration of satisfiable 2-SAT formulae, How does the chromatic number of a random graph vary?, A probabilistic algorithm for vertex cover, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, A note on rainbow-free colorings of uniform hypergraphs, Stochastic recursions on directed random graphs, A critical probability for biclique partition of \(G_{n,p}\), A note on the H index in random networks, A likelihood-ratio type test for stochastic block models with bounded degrees, Local heuristics and the emergence of spanning subgraphs in complex networks, Balanced allocation and dictionaries with tightly packed constant size bins, The Number of Satisfying Assignments of Random Regulark-SAT Formulas, Bounds on the bisection width for random \(d\)-regular graphs, A Turán-type problem on distances in graphs, The critical point of \(k\)-clique percolation in the Erdős-Rényi graph, Generating hierarchial scale-free graphs from fractals, Formation of a giant component in the intersection graph of a random chord diagram, Order preserving hierarchical agglomerative clustering, Random walk on the random connection model, Monadic second-order properties of very sparse random graphs, A new algorithm design technique for hard problems, Glauber dynamics for Ising models on random regular graphs: cut-off and metastability, Concentration of maximum degree in random planar graphs, Edge-colouring graphs with bounded local degree sums, Random graph languages, A gentle introduction to the differential equation method and dynamic concentration, Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority gates, A probabilistic approach to the leader problem in random graphs, Outliers in spectrum of sparse Wigner matrices, Conflict-free connection number of random graphs, Mean field dynamics of stochastic cellular automata for random and small-world graphs, The asymptotic value of energy for matrices with degree-distance-based entries of random graphs, An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths, Decomposing Random Graphs into Few Cycles and Edges, On the Length of a Random Minimum Spanning Tree, Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example, Path Ramsey Number for Random Graphs, Manipulative Waiters with Probabilistic Intuition, The Threshold Probability for Long Cycles, Planting Colourings Silently, On the Number of 4-Edge Paths in Graphs With Given Edge Density, Critical Window for Connectivity in the Configuration Model, Bridge-Addability, Edge-Expansion and Connectivity, Maximum sparse induced subgraphs of the binomial random graph with given number of edges, How affinity influences tolerance in an idiotypic network, Diameter in ultra‐small scale‐free random graphs, Information Spreading in Dynamic Networks: An Analytical Approach, Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs, The size Ramsey number of short subdivisions of bounded degree graphs, On the number of alternating paths in random graphs, Percolation on complex networks: theory and application, Statistical physics approaches to the complex Earth system, Keisler's order is not simple (and simple theories may not be either), Lower bounds of size Ramsey number for graphs with small independence number, \(q\)-random walks on \(\mathbb Z^d\), \(d = 1, 2, 3\), MSO 0-1 law for recursive random trees, Emergence of the circle in a statistical model of random cubic graphs, Synchronization in random networks with given expected degree sequences, Fractionally total colouring \(G_{n,p}\), On certain connectivity properties of the internet topology, Epidemic random network simulations in a distributed computing environment, Partially dynamic efficient algorithms for distributed shortest paths, Resilience and reliability analysis of P2P network systems, Note on directed proper connection number of a random graph, Shareholding Networks and Centrality: An Application to the Italian Financial Market, A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time, On the chromatic number of the preferential attachment graph, Search for an immobile hider on a stochastic network, Strong identification codes for graphs, Extremal paths in inhomogenous random graphs, Agency, potential and contagion, Model-free two-sample test for network-valued data, Geometry of the minimal spanning tree of a random 3-regular graph, Clustering coefficients of large networks, Fast winning strategies in maker-breaker games, Random simplicial complexes in the medial regime, On Weisfeiler-Leman invariance: subgraph counts and related graph properties, Bipartite and directed scale-free complex networks arising from zeta functions, Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups, Mixed connectivity properties of random graphs and some special graphs, The size of a maximum subgraph of the random graph with a given number of edges, Birds of a feather or opposites attract - effects in network modelling, Typical distances in a geometric model for complex networks, Core forging and local limit theorems for the \(k\)-core of random graphs, Goldberg's conjecture is true for random multigraphs, On fractional cut covers, Localization game for random graphs, \(\mathcal{H}_\infty\) network optimization for edge consensus, Phase transitions and percolation at criticality in enhanced random connection models, Parallel execution of schedules with random dependency graph, Component structure of the configuration model: Barely supercritical case, Discrimination through versioning with advertising in social networks, Best response dynamics on random graphs, The distribution of the maximum number of common neighbors in the random graph, Cliques and chromatic number in multiregime random graphs, Networks of random trees as a model of neuronal connectivity, Typical and generic ranks in matrix completion, The energy of random signed graph, A discrete model of market interaction in the presence of social networks and price discrimination, Consensus and synchronization problems on small-world networks, Hamiltonicity in random graphs is born resilient, Gibbs random graphs on point processes, On the average-case complexity of parameterized clique, On the limiting distribution of the metric dimension for random forests, Approximately strongly regular graphs, Waiter-client and client-waiter Hamiltonicity games on random graphs
