Publication:5294699

Publication date: 26 July 2007

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) 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

Maximal rank in matrix spaces via graph matchings, \(C_4\)-free subgraphs with large average degree, On the Hamiltonicity of random bipartite graphs, TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM, 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, Subdivisions in apex graphs, On different ``middle parts of a tree, Minimal 2-connected graphs satisfying the even cut condition, The complexity of recognizing minimally tough graphs, Rolling backwards can move you forward: On embedding problems in sparse expanders, Planar Turán numbers of cycles: a counterexample, Hereditary quasirandomness without regularity, Slider-pinning rigidity: a Maxwell-Laman-type theorem, Contractible edges and liftable vertices in a 4-connected graph, Properties of minimally \(t\)-tough graphs, Turán‐ and Ramsey‐type results for unavoidable subgraphs, The intersection spectrum of 3‐chromatic intersecting hypergraphs, Order plus size of τ‐critical graphs, Coidempotent graph of a ring, Structure and supersaturation for intersecting families, Large simple \(d\)-cycles in simplicial complexes, Maximal generalized rank in graphical matrix spaces, Coloring directed hypergraphs, Polychromatic 4-coloring of cubic bipartite plane graphs, On the existence of ordinary triangles, The size Ramsey number of a directed path, Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, Properly 3-contractible edges in a minimally 3-connected graph, From Abel’s Binomial Theorem to Cayley’s Tree Formula, The minimum size of graphs satisfying cut conditions, Maximizing the Number of Independent Sets of a Fixed Size, A Hitting Time Formula for the Discrete Green's Function, On some identities with binomial coefficients, Shadow ratio of hypergraphs with bounded degree, A probabilistic representation of the ground state expectation of fractional powers of the boson number operator, Fractional total colourings of graphs of high girth, Colouring edges with many colours in cycles, On the sizes of expander graphs and minimum distances of graph codes, Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, Topological minors in line graphs -- a proof of Zha's conjecture, Many cliques with few edges and bounded maximum degree, Unnamed Item, Compatible Hamilton cycles in Dirac graphs, Linear dependence between hereditary quasirandomness conditions, On r‐Connected Graphs with No Semi‐topological r‐Wheel, Robust Hamiltonicity of Dirac graphs, A proof of the molecular conjecture, Hypergraph Ramsey numbers, Edge-disjoint Hamilton cycles in graphs, Counting minimum weight arborescences, Contractible edges and contractible triangles in a 3-connected graph, On hyperplanes and polytopes, Unnamed Item, Matchings with few colors in colored complete graphs and hypergraphs, Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects, Unnamed Item, Discrepancy and eigenvalues of Cayley graphs, Compatible Hamilton cycles in random graphs, QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS, The chromatic number of random lifts of, Cycle packing, On Cui-Kano's Characterization Problem on Graph Factors, Searching for majority with k-tuple queries, On determination of positive-definiteness for an anisotropic operator, Supersaturation for subgraph counts, On the bipartite graph packing problem