scientific article; zbMATH DE number 487720

MaRDI QIDQ4276003zbMATH OpenFDO

Authors László Lovász

Publication date 9 January 1994

Recommendations

scientific article; zbMATH DE number 5174567
scientific article; zbMATH DE number 46849
A walk through combinatorics. An introduction to enumeration and graph theory. With a foreword by Richard Stanley
A walk through combinatorics. An introduction to enumeration and graph theory
scientific article; zbMATH DE number 2010357

Cited in

(only showing first 100 items - show all)

The Feynman graph representation of convolution semigroups and its applications to Lévy statistics
On a theorem of Sewell and Trotter
Strong structural properties of unidirectional star graphs
Packing circuits in matroids
An improved bound on the maximum agreement subtree problem
Fibonacci index and stability number of graphs: a polyhedral study
The interchange graphs of tournaments with minimum score vectors are exactly hypercubes
Large circuits in binary matroids of large cogirth. I
On-line coloring \(k\)-colorable graphs
Communication complexity of fault-tolerant information diffusion
A lower bound on the probability of a union
Aztec diamonds, checkerboard graphs, and spanning trees
On quasi-Cayley graphs
On embedding expanders into \(\ell_p\) spaces
On random planar graphs, the number of planar graphs and their triangulations
On the number of edges not covered by monochromatic copies of a fixed graph.
Computing Prüfer codes efficiently in parallel
Coloring graphs with sparse neighborhoods
Efficient collective communciation in optical networks
An upper bound on the sum of squares of degrees in a graph
Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
Decompositions of graphs into cycles with chords
Maximizing the number of independent sets of fixed size in connected graphs with given independence number
Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
On ordering of complements of graphs with respect to matching numbers
The multiplier problem of the calculus of variations for scalar ordinary differential equations
Decomposition of a graph into two disjoint odd subgraphs
On subtrees of trees
Even cycles in hypergraphs
The topology of the coloring complex
Resilience of ranks of higher inclusion matrices
Links in the complex of separable graphs
Nowhere-zero flows in random graphs
Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
Superdominance order and distance of trees with bounded maximum degree
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
Bell numbers, their relatives, and algebraic differential equations
Maximizing the sum of the squares of the degrees of a graph
Multicoloured extremal problems
The rapid mixing of random walks defined by an \(n\)-cube
Extremal problems for ordered hypergraphs: small patterns and some enumeration
Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model
Matrices uniquely determined by their lonesums
Edge lifting and total domination in graphs
Shadows and intersections in vector spaces
Pach's selection theorem does not admit a topological extension
The feasible region of hypergraphs
On \(\sigma\)-span and \(F\)-span of trees and full binary trees
Extremal problems on k-ary trees with respect to the cover cost and reverse cover cost
Channels, billiards, and perfect matching 2-divisibility
Tournament quasirandomness from local counting
Extremal eigenvalues of critical Erdős-Rényi graphs
Covering graphs by monochromatic trees and Helly-type results for hypergraphs
Bollobás-type theorems for hemi-bundled two families
An isoperimetric inequality for Hamming balls and local expansion in hypercubes
On the treewidth of Hanoi graphs
Cycles of a given length in tournaments
No additional tournaments are quasirandom-forcing
On asymptotic properties of Bell polynomials and concentration of vertex degree of large random graphs
Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
Every graph contains a linearly sized induced subgraph with all degrees odd
On packing time-respecting arborescences
Fibered simple knots
Neighbor connectivity of \(k\)-ary \(n\)-cubes
Spectral determinants and an Ambarzumian type theorem on graphs
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
Billiards, channels, and perfect matching 2-divisibility
Stability for vertex isoperimetry in the cube
On the exponential generating function of labelled trees
New bounds on the maximum size of Sperner partition systems
Nonempty intersection of longest paths in graphs without forbidden pairs
Express the number of spanning trees in term of degrees
Some extremal ratios of the distance and subtree problems in binary trees
Mixed matchings in graphs
Extremal cover cost and reverse cover cost of trees with given segment sequence
Vertex-isoperimetric stability in the hypercube
Two-weight codes: upper bounds and new optimal constructions
Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks
On independent doubly chorded cycles
On ve-degrees and ev-degrees in graphs
Bruhat intervals as rooks on skew Ferrers boards
The poset on connected graphs is Sperner
Per-spectral characterizations of some bipartite graphs
Decision procedures for term algebras with integer constraints
A majorization method for localizing graph topological indices
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
Steiner diagrams and \(k\)-star hubs
Sieve methods in combinatorics
Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
The number of spanning trees of plane graphs with reflective symmetry
Generalized triangulations and diagonal-free subsets of stack polyominoes
An upper bound for Hilbert cubes
Shannon capacity and the categorical product
Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
Distinct degrees and homogeneous sets
A result on large induced subgraphs with prescribed residues in bipartite graphs
Stability theorems for some Kruskal-Katona type results
Genus 0 and 1 Hurwitz numbers: Recursions, formulas, and graph-theoretic interpretations
Connectivity for bridge-alterable graph classes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4276003)