Publication:5294699
From MaRDI portal
zbMath1120.05001MaRDI QIDQ5294699
Publication date: 26 July 2007
05C35: Extremal problems in graph theory
05A15: Exact enumeration problems, generating functions
05A18: Partitions of sets
05A17: Combinatorial aspects of partitions of integers
05C65: Hypergraphs
05C30: Enumeration in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C55: Generalized Ramsey theory
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
05Cxx: Graph theory
Related Items
Hereditary quasirandomness without regularity, Unnamed Item, On r‐Connected Graphs with No Semi‐topological r‐Wheel, Rolling backwards can move you forward: On embedding problems in sparse expanders, Unnamed Item, Unnamed Item, Cycle packing, Searching for majority with k-tuple queries, Maximizing the Number of Independent Sets of a Fixed Size, A Hitting Time Formula for the Discrete Green's Function, Robust Hamiltonicity of Dirac graphs, Turán‐ and Ramsey‐type results for unavoidable subgraphs, The intersection spectrum of 3‐chromatic intersecting hypergraphs, Order plus size of τ‐critical graphs, Large simple \(d\)-cycles in simplicial complexes, Maximal generalized rank in graphical matrix spaces, Coloring directed hypergraphs, Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, On determination of positive-definiteness for an anisotropic operator, Polychromatic 4-coloring of cubic bipartite plane graphs, The size Ramsey number of a directed path, A probabilistic representation of the ground state expectation of fractional powers of the boson number operator, Colouring edges with many colours in cycles, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, Topological minors in line graphs -- a proof of Zha's conjecture, A proof of the molecular conjecture, Slider-pinning rigidity: a Maxwell-Laman-type theorem, Fractional total colourings of graphs of high girth, Compatible Hamilton cycles in Dirac graphs, Edge-disjoint Hamilton cycles in graphs, On hyperplanes and polytopes, On different ``middle parts of a tree, On the existence of ordinary triangles, The minimum size of graphs satisfying cut conditions, Counting minimum weight arborescences, Many cliques with few edges and bounded maximum degree, Linear dependence between hereditary quasirandomness conditions, Contractible edges and contractible triangles in a 3-connected graph, Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects, Supersaturation for subgraph counts, \(C_4\)-free subgraphs with large average degree, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, Skew shape asymptotics, a case-based introduction, A constructive characterization of 4-connected graphs, Planar Turán numbers of cycles: a counterexample, Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph, Matchings with few colors in colored complete graphs and hypergraphs, On the bipartite graph packing problem, Maximal rank in matrix spaces via graph matchings, Subdivisions in apex graphs, Properties of minimally \(t\)-tough graphs, Structure and supersaturation for intersecting families, On the sizes of expander graphs and minimum distances of graph codes, On the Hamiltonicity of random bipartite graphs, Minimal 2-connected graphs satisfying the even cut condition, The complexity of recognizing minimally tough graphs, Contractible edges and liftable vertices in a 4-connected graph, Properly 3-contractible edges in a minimally 3-connected graph, On some identities with binomial coefficients, Shadow ratio of hypergraphs with bounded degree, Discrepancy and eigenvalues of Cayley graphs, Compatible Hamilton cycles in random graphs, The chromatic number of random lifts of, On Cui-Kano's Characterization Problem on Graph Factors, QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS, TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM, Hypergraph Ramsey numbers
