scientific article; zbMATH DE number 487720

No author found.

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 (only showing first 100 items - show all)

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 ⋮ Chemically inspired Erdős-Rényi hypergraphs ⋮ 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 ⋮ Graphs with many independent vertex cuts

This page was built for publication: