scientific article; zbMATH DE number 487720

Publication date: 9 January 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

combinatorics eigenvalues random walks graphs exercises electric resistance

Extremal problems in graph theory (05C35) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial aspects of partitions of integers (05A17) Hypergraphs (05C65) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Generalized Ramsey theory (05C55) Connectivity (05C40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (05Cxx)

Related Items

Bell numbers, their relatives, and algebraic differential equations, Maximizing the sum of the squares of the degrees of a graph, Connectivity for bridge-alterable graph classes, Intersecting families in $\begin{pmatrix}[m\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}$], Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections, Multicoloured extremal problems, The rapid mixing of random walks defined by an $n$-cube, Structural parameterizations of clique coloring, Path-based depth-first search for strong and biconnected components, Extremal problems for ordered hypergraphs: small patterns and some enumeration, $\Delta $-list vertex coloring in linear time, Stability in the Erdős-Gallai theorems on cycles and paths, A lower bound on the probability of a union, Aztec diamonds, checkerboard graphs, and spanning trees, On quasi-Cayley graphs, Every graph contains a linearly sized induced subgraph with all degrees odd, On embedding expanders into $\ell_p$ spaces, On packing time-respecting arborescences, Fibered simple knots, Large circuits in binary matroids of large cogirth. I, Neighbor connectivity of $k$-ary $n$-cubes, Decompositions of graphs into cycles with chords, Trees in greedy colorings of hypergraphs, Maximizing the number of independent sets of fixed size in connected graphs with given independence number, A tour of $M$-part $L$-Sperner families, The extendability of matchings in strongly regular graphs, Spectral determinants and an Ambarzumian type theorem on graphs, On generalizations of the Petersen graph and the Coxeter graph, Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model, Complete $r$-partite graphs determined by their domination polynomial, Matrices uniquely determined by their lonesums, On random planar graphs, the number of planar graphs and their triangulations, Edge lifting and total domination in graphs, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Shadows and intersections in vector spaces, On the number of edges not covered by monochromatic copies of a fixed graph., Pairs of edges as chords and as cut-edges, Symmetry classes of spanning trees of aztec diamonds and perfect matchings of odd squares with a unit hole, The complexity of the empire colouring problem, 2-cell embeddings with prescribed face lengths and genus, Shadows and intersections: Stability and new proofs, On ordering of complements of graphs with respect to matching numbers, The poset structures admitting the extended binary Golay code to be a perfect code, Orienting Cayley graphs generated by transposition trees, Induced colorful trees and paths in large chromatic graphs, Cycle lengths in sparse graphs, On the $A_{\alpha}$-spectra of trees, Pach's selection theorem does not admit a topological extension, Max-cut and extendability of matchings in distance-regular graphs, The multiplier problem of the calculus of variations for scalar ordinary differential equations, Decomposition of a graph into two disjoint odd subgraphs, The feasible region of hypergraphs, On $\sigma$-span and $F$-span of trees and full binary trees, On a poset of trees, Intersecting antichains and shadows in linear lattices, Complexity of clique coloring and related problems, A tight analysis and near-optimal instances of the algorithm of Anderson and Woll, Computational complexity of long paths and cycles in faulty hypercubes, On subtrees of trees, Even cycles in hypergraphs, The chromatic gap and its extremes, The topology of the coloring complex, Resilience of ranks of higher inclusion matrices, Extremal matching energy of complements of trees, Extremal problems on $k$-ary trees with respect to the cover cost and reverse cover cost, Channels, billiards, and perfect matching 2-divisibility, Nonempty intersection of longest paths in series-parallel graphs, Chromatic Ramsey number of acyclic hypergraphs, Disjoint chorded cycles in graphs, Tournament quasirandomness from local counting, The Feynman graph representation of convolution semigroups and its applications to Lévy statistics, Extremal eigenvalues of critical Erdős-Rényi graphs, Computation of certain infinite series of the form $\sum f(n)n^k $ for arbitrary real-valued $k$, On a theorem of Sewell and Trotter, Strong structural properties of unidirectional star graphs, Covering graphs by monochromatic trees and Helly-type results for hypergraphs, Randomized diffusion for indivisible loads, Links in the complex of separable graphs, Packing circuits in matroids, On-line coloring $k$-colorable graphs, Communication complexity of fault-tolerant information diffusion, Bollobás-type theorems for hemi-bundled two families, Computing Prüfer codes efficiently in parallel, Coloring graphs with sparse neighborhoods, An isoperimetric inequality for Hamming balls and local expansion in hypercubes, An improved bound on the maximum agreement subtree problem, On the treewidth of Hanoi graphs, Efficient collective communciation in optical networks, Fibonacci index and stability number of graphs: a polyhedral study, The interchange graphs of tournaments with minimum score vectors are exactly hypercubes, An upper bound on the sum of squares of degrees in a graph, Nowhere-zero flows in random graphs, Cycles of a given length in tournaments, Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems., Superdominance order and distance of trees with bounded maximum degree, No additional tournaments are quasirandom-forcing, Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness, Variations sur le thème ${E+\overline {E} = XY}$ (Variations on the theme ${E+\overline {E} = XY})$, The rank and minimal border strip decompositions of a skew partition, On asymptotic properties of Bell polynomials and concentration of vertex degree of large random graphs, Integral-root polynomials and chromatic uniqueness of graphs, Disjointness graphs of segments in the space, Packing triangles in a graph and its complement, Hypergraphs without non-trivial intersecting subgraphs, Total choosability of multicircuits II, On $ve$-degrees and $ev$-degrees in graphs, Chromatic uniqueness of zero-divisor graphs, Unnamed Item, Bruhat intervals as rooks on skew Ferrers boards, An upper bound for Hilbert cubes, Inside the critical window for cohomology of random k -complexes, RECYCLING RANDOM BITS IN PARALLEL, The poset on connected graphs is Sperner, Shannon capacity and the categorical product, On Intersecting Chains in Boolean Algebras, Per-spectral characterizations of some bipartite graphs, An Upper Bound on the Size of Sidon Sets, Further parameterized algorithms for the $\mathcal{F}$-free edge deletion problem, Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams, Generalized Turán results for intersecting cliques, Shotgun reconstruction in the hypercube, Algebraic and combinatorial expansion in random simplicial complexes, On subgraphs with degrees of prescribed residues in the random graph, Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions, Sharp threshold for the Erdős–Ko–Rado theorem, On multichromatic numbers of widely colorable graphs, Counting spanning trees in a complete bipartite graph which contain a given spanning forest, Distinct degrees and homogeneous sets, Extremal problems for connected set enumeration, Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs, Large monochromatic components in colorings of complete hypergraphs, A result on large induced subgraphs with prescribed residues in bipartite graphs, Paired 2-disjoint path covers of burnt pancake graphs with faulty elements, A Kruskal-Katona-type theorem for graphs: $q$-Kneser graphs, Expander graphs and their applications, Billiards, channels, and perfect matching 2-divisibility, A spectral technique for random satisfiable 3CNF formulas, Prominent examples of flip processes, Minimising the total number of subsets and supersets, On the sizes of generalized cactus graphs, Stability for vertex isoperimetry in the cube, Convergence of graphs with intermediate density, Decision procedures for term algebras with integer constraints, The Proofs of Two Directed Paths Conjectures of Bollobás and Leader, On the generalization of the Lambert $W$ function, Stability theorems for some Kruskal-Katona type results, Inequalities for the first-fit chromatic number, A majorization method for localizing graph topological indices, Packing, counting and covering Hamilton cycles in random directed graphs, On the exponential generating function of labelled trees, Decompositions of complete uniform hypergraphs into Hamilton Berge cycles, New bounds on the maximum size of Sperner partition systems, COLORING ALGORITHMS ON SUBCUBIC GRAPHS, Genus $0$ and $1$ Hurwitz numbers: Recursions, formulas, and graph-theoretic interpretations, On the k-matchings of the complements of bicyclic graphs, Nonempty intersection of longest paths in graphs without forbidden pairs, Enumeration of spanning trees on Apollonian networks, Unnamed Item, On the Random Satisfiable Process, The Multilinear Polytope for Acyclic Hypergraphs, Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs, Steiner diagrams and $k$-star hubs, Packing, counting and covering Hamilton cycles in random directed graphs, Express the number of spanning trees in term of degrees, Semi-Strong Colouring of Intersecting Hypergraphs, Rainbow and orthogonal paths in factorizations ofKn, Sieve methods in combinatorics, Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence, Facets of the linear ordering polytope: a unification for the fence family through weighted graphs, Perfect matchings in random bipartite graphs with minimal degree at least 2, Unnamed Item, Acyclic orientations and the chromatic polynomial, Modularity of some distance graphs, Unnamed Item, Some extremal ratios of the distance and subtree problems in binary trees, Mixed matchings in graphs, On directed local chromatic number, shift graphs, and Borsuk-like graphs, Combinatorial properties of poly-Bernoulli relatives, Extremal cover cost and reverse cover cost of trees with given segment sequence, Vertex-isoperimetric stability in the hypercube, On Erdős–Ko–Rado for Random Hypergraphs II, Random Graphs with Few Disjoint Cycles, Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem, Steiner quadruple systems with point-regular abelian automorphism groups, Two-weight codes: upper bounds and new optimal constructions, Sperner Partition Systems, On Multirate Rearrangeable Clos Networks, Unnamed Item, The Shifted Turán Sieve Method on Tournaments, The number of spanning trees of plane graphs with reflective symmetry, Generalized triangulations and diagonal-free subsets of stack polyominoes, On a Poset of Trees II, Matchings in complete bipartite graphs and the $r$-Lah numbers, Asymptotic expansion of the transition density of the semigroup associated to a SDE driven by Lévy noise, Relations between the Local Chromatic Number and Its Directed Version, Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks, On independent doubly chorded cycles, Edge lifting and Roman domination in graphs