Covers, orientations and factors
From MaRDI portal
Publication:785575
DOI10.37236/8767zbMath1445.05081arXiv1905.06678OpenAlexW3082346739MaRDI QIDQ785575
Publication date: 7 August 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.06678
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shattering, graph orientations, and connectivity
- Bounds on the number of Eulerian orientations
- Lifts, discrepancy and nearly optimal spectral gap
- On the number of matchings in regular graphs
- Independent sets in regular graphs and sum-free subsets of finite groups
- Counting degree-constrained subgraphs and orientations
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- The Number of Independent Sets in a Regular Graph
- On the Number of Perfect Matchings in Random Lifts
- On the Expansion of Group-Based Lifts
- Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: Covers, orientations and factors
