scientific article; zbMATH DE number 2123255

Publication date: 16 December 2004

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

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)

Related Items

Merging the A-and Q-spectral theories ⋮ A generalization of a Turán’s theorem about maximum clique on graphs ⋮ Hyperbolic families and coloring graphs on surfaces ⋮ Unnamed Item ⋮ Unavoidable chromatic patterns in 2‐colorings of the complete graph ⋮ \textsf{Dew}: a transparent constant-sized polynomial commitment scheme ⋮ Unnamed Item ⋮ Extremal numbers of hypergraph suspensions of even cycles ⋮ Most edge‐orderings of K_n have maximal altitude ⋮ Unnamed Item ⋮ Ramsey numbers of ordered graphs ⋮ Keyed hash function from large girth expander graphs ⋮ Nonpositive sectional curvature for (𝑝,𝑞,𝑟)-complexes ⋮ On the number of edge-disjoint triangles in \(K_4\)-free graphs ⋮ Unnamed Item ⋮ The Parameterized Complexity of Graph Cyclability ⋮ An Average Case NP-complete Graph Colouring Problem ⋮ Unnamed Item ⋮ Covering Metric Spaces by Few Trees ⋮ Externally definable sets and dependent pairs II ⋮ Graphs, friends and acquaintances ⋮ On Kelley’s intersection numbers ⋮ The maximum average connectivity among all orientations of a graph ⋮ Triple placement of graphs ⋮ A fast network-decomposition algorithm and its applications to constant-time distributed computation ⋮ Hyperconnectivity of graphs ⋮ Unnamed Item ⋮ Critical star multigraphs ⋮ Multicolored set multipartite Ramsey numbers ⋮ Large induced degenerate subgraphs ⋮ Total monochromatic connection of graphs ⋮ Partial order complementation graphs ⋮ Knots and Graphs: Two Centuries of Interaction ⋮ Extending precolorings to distinguish group actions ⋮ First-fit colorings of graphs with no cycles of a prescribed even length ⋮ An Ore-type analogue of the Sauer-Spencer theorem ⋮ Triangle-free four-chromatic graphs ⋮ Efficient enumeration of graph orientations with sources ⋮ Note on vertex and total proper connection numbers ⋮ Retracted: A remark on the weak Turán's theorem ⋮ Better bounds for perpetual gossiping ⋮ On small balanceable, strongly-balanceable and omnitonal graphs ⋮ Super cyclically edge-connected vertex-transitive graphs of girth at least 5 ⋮ Repeated distances in space ⋮ Combinatorial theorems in sparse random sets ⋮ Unbreakable matroids ⋮ Covering metric spaces by few trees ⋮ On the upper bounds of the numbers of perfect matchings in graphs with given parameters ⋮ On the tacnodes of configurations of conics in the projective plane ⋮ Multipodal structure and phase transitions in large constrained graphs ⋮ Contagious sets in dense graphs ⋮ Bisecting and \(D\)-secting families for set systems ⋮ Special subdivisions of \(K_4\) and 4-chromatic graphs ⋮ Spanning trees in dense directed graphs ⋮ Favourite distances in \(3\)-space ⋮ Augmented \(k\)-ary \(n\)-cubes ⋮ Distinct degrees and homogeneous sets ⋮ New results on EX graphs ⋮ Arboricity, \(h\)-index, and dynamic algorithms ⋮ On the size and structure of graphs with a constant number of 1-factors ⋮ Characterization of minimally \((2,l)\)-connected graphs ⋮ Directed domination in oriented graphs ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ Non-separating induced cycles in graphs ⋮ On families of graphs of large cycle indicator, matrices of large order and key exchange protocols with nonlinear polynomial maps of small degree ⋮ Maximum matching in regular and almost regular graphs ⋮ Topological minors in bipartite graphs ⋮ A simpler linear-time recognition of circular-arc graphs ⋮ Contractions and minimal k-colorability ⋮ Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs ⋮ On the maximal number of certain subgraphs in \(K_ r\)-free graphs ⋮ Rotation numbers for complete tripartite graphs ⋮ On the chromatic number of \(H\)-free graphs of large minimum degree ⋮ Turán numbers for disjoint copies of graphs ⋮ Distinct degrees in induced subgraphs ⋮ Extremal results for odd cycles in sparse pseudorandom graphs ⋮ Edges in graphs with large girth ⋮ Cooperative cross-entropy method for generating entangled networks ⋮ FPT algorithms for domination in sparse graphs and beyond ⋮ Biased graphs with no two vertex-disjoint unbalanced cycles ⋮ Parity check matrices and product representations of squares ⋮ Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded ⋮ A short derivation for Turán numbers of paths ⋮ The multicovering radius problem for some types of discrete structures ⋮ On the Hamiltonicity of triple systems with high minimum degree ⋮ Unavoidable patterns ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case ⋮ Enomoto and Ota's conjecture holds for large graphs ⋮ One-to-many node-disjoint paths in \((n,k)\)-star graphs ⋮ Approximate shortest paths guided by a small index ⋮ Strong chromatic index of \(k\)-degenerate graphs ⋮ Small cycles and 2-factor passing through any given vertices in graphs ⋮ A note on a packing problem in transitive tournaments ⋮ The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree ⋮ A lower bound for the spectral radius of graphs with fixed diameter ⋮ Graphic sequences with a realization containing a union of cliques ⋮ A note on short cycles in a hypercube ⋮ A combinatorial characterization of finite groups of prime exponent ⋮ A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems ⋮ \(\mathcal{F}\)-saturation games ⋮ The saturation number for the length of degree monotone paths ⋮ The maximal number of induced \(r\)-partite subgraphs ⋮ A note on a conjecture of Gallai ⋮ The number of cliques in graphs of given order and size ⋮ Spectral threshold for extremal cyclic edge-connectivity ⋮ Matchings and covers in hypergraphs ⋮ Covering a graph by topological complete subgraphs ⋮ Paths and cycles concerning independence edges ⋮ Minimum weakly fundamental cycle bases are hard to find ⋮ Minimum number of edges that occur in odd cycles ⋮ On \(n\)-dependence ⋮ On long cycles in a 2-connected bipartite graph ⋮ Property testing in high-dimensional Ising models ⋮ Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\) ⋮ Minimizing the Laplacian spectral radius of trees with given matching number ⋮ Lipschitz representations of subsets of the cube ⋮ Systolic geometry of connected sums and cyclic covering. ⋮ From edge-coloring to strong edge-coloring ⋮ Packing two graphs of order n having total size at most 2n-2 ⋮ The maximum number of disjoint pairs in a family of subsets ⋮ Decomposition of graphs and monotone formula size of homogeneous functions ⋮ Packing of partial designs

This page was built for publication: