Counting spanning subgraphs in dense hypergraphs

DOI10.1017/S0963548324000178MaRDI QIDQ6883596zbMATH OpenFDO

Authors Richard Montgomery, Matías Pavez-Signé

Publication date 16 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://wrap.warwick.ac.uk/178286/7/WRAP-counting-spanning-subgraphs-dense-hypergraphs-2023.pdf

zbMATH Keywords

degree conditionshypergraphsspanning subgraphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42) Hypergraphs (05C65)

Cites work

• A general approach to transversal versions of Dirac‐type theorems
• An approximate Dirac-type theorem for k-uniform hypergraphs
• Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs
• Counting Hamilton cycles in Dirac hypergraphs
• Counting Hamilton cycles in Dirac hypergraphs
• Degrees giving independent edges in a hypergraph
• Edge-decompositions of graphs with high minimum degree
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Embedding large subgraphs into dense graphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Hamiltonian cycles in Dirac graphs
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 1286511 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 863469 (Why is no real title available?)
• scientific article; zbMATH DE number 863492 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• On the number of Hamiltonian cycles in Dirac graphs
• Proof of a Packing Conjecture of Bollobás
• Proof of the Alon-Yuster conjecture
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Proof of the Seymour conjecture for large graphs
• Recent advances on Dirac-type problems for hypergraphs
• Some Theorems on Abstract Graphs
• Spanning trees in dense graphs
• Squares of Hamiltonian cycles in 3-uniform hypergraphs
• The minimum degree threshold for perfect graph packings
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
• Tight bounds for embedding bounded degree trees
• Towards a hypergraph version of the Pósa-Seymour conjecture

This page was built for publication: Counting spanning subgraphs in dense hypergraphs

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