Publication:4198785
From MaRDI portal
zbMath0411.05032MaRDI QIDQ4198785
Publication date: 1979
matching; extremal graphs; random graphs; Ramsey theory; connectivity; flows; chromatic numbers; coloring; electrical networks; graphs and groups; four colour problem
94C30: Applications of design theory to circuits and networks
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05Cxx: Graph theory
Related Items
Coalescence times andFSTvalues in subdivided populations with symmetric structure, Edge‐cutsets in the directed hypercube, Unnamed Item, Negative association in uniform forests and connected graphs, A review of random graphs, Multiplicités des valeurs propres et transformations étoile-triangle des graphes, Techniques of computable set theory with applications to proof verification, Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations, On the insufficiency of linear diagrams for syllogisms, Qualitative stability of linear systems, The total chromatic number of graphs having large maximum degree, A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs, Isometric embedding in \(\ell_ p\)-spaces, Clique graphs of time graphs, Hamiltonicity and colorings of arrangement graphs, On the diameter and girth of a zero-divisor graph, Almost all regular graphs are Hamiltonian, On the problem of finding small subdivision and homomorphism bases for classes of countable graphs, Construction techniques for some thin sets in duals of compact abelian groups, The binding number of a graph and its circuits, Note on induced subgraphs of the unit distance graph \(E^ n\), Generalized handles in graphs and connected sums of manifolds, An NC algorithm for Brooks' theorem, An algorithm for generating all maximal independent subsets of posets, Hadwiger's conjecture is true for almost every graph, Sorting in one round, The embedding of partial triple systems when 4 divides \(\lambda\), Graphs without large triangle free subgraphs, Cycles and spanning trees, Size and connectivity of the \(k\)-core of a random graph, Infinitary logics and 0-1 laws, Symmetric pants decompositions of Riemann surfaces, Optimal parallel algorithms for finding cut vertices and bridges of interval graphs, On the n-cutset property, Tilings and discrete Dirichlet problems, On the spectra of certain graphs arising from finite fields, On the parallel dynamics of the \(Q\)-state Potts and \(Q\)-Ising neural networks, The combinatorics of effective resistances and resistive inverses, The zero-divisor graph of a commutative ring, Codimension-one foliations and oriented graphs, Critical probabilities for site and bond percolation models, Schubert graphs, symmetric groups and flags of Boolean lattices, The automorphism group of a structural matrix algebra, Recent developments in total colouring, One-way cellular automata on Cayley graphs, Cayley, Marty and Schreier hypergraphs, Hyperedge channels are abelian, Edge search in hypergraphs, \(K\)-groups associated with substitution minimal systems, Euler cycles in the complete graph \(K_{2m+1}\), The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices, The complexity of the evaluation of complex algebra expressions, The permutation-path coloring problem on trees., A Nim game played on graphs., Remarks on the computation of the horizon of a digital terrain, Finding 2-edge connected spanning subgraphs., Planar quorums, The oriented cycle game, Characterization of pure strategy equilibria infinite anonymous games, Pregeometric concepts on graphs and cellular networks as possible models of space-time at the Planck-scale, Matrix method for linear sequential dynamical systems on digraphs, Edge search in graphs and hypergraphs of bounded rank, Growth profile and invariant measures for the weakly supercritical contact process on a homogeneous tree, Triangulations intersect nicely, The computational difficulty of manipulating an election, Counting bridgeless graphs, A threshold for perfect matchings in random d-pure hypergraphs, Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem, Almost-spanning subgraphs with bounded degree in dense graphs, The connectivity of a graph on uniform points on [0,\,1\(^{d}\).], Discrete dynamical systems on graphs and Boolean functions, Every tree contains a large induced subgraph with all degrees odd, The reversing number of a digraph, A new approach to solving three combinatorial enumeration problems on planar graphs, Stability of random matrix models, Random walks and orthogonal functions associated with highly symmetric graphs, Extremal theory for convex matchings in convex geometric graphs, Compensations in small divisor problems, On the minimum number of logical clauses inferred from examples, Matrix scaling for large-scale system decomposition, Stable matchings and linear programming, Bisimulation for probabilistic transition systems: A coalgebraic approach, Jacobian tori associated with a finite graph and its abelian covering graphs, A fast algorithm for the construction of universal footprinting templates in DNA, Network formation and stable equilibrium, The decomposition of \(K_v\) into \(K_2\times K_5\)'s, Steiner diagrams and \(k\)-star hubs, On enumerating minimal dicuts and strongly connected subgraphs, Synchronization in random networks with given expected degree sequences, Independent sets in triangle-free cubic planar graphs, Unnamed Item, First-passage percolation, network flows and electrical resistances, Graphs with given group and given constant link, Conditional connectivity, Kuratowski's theorem, Vertices of given degree in a random graph, Asymptotic distributions in random graphs with applications to social networks, An upper bound for the total chromatic number of dense graphs, Unnamed Item, Laplace eigenvalues and bandwidth‐type invariants of graphs, Scheduling with forbidden sets
