Transfer theorem converts max-degree independence bounds to average-degree bounds for hereditary uniform hypergraphs, with applications to cycle-free graphs and bounded-clique graphs.
On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.CO 3verdicts
UNVERDICTED 3representative citing papers
Colour-balanced k-edge-coloured K_{2kt} has a perfect matching adjustable to colour-balance by recolouring O(k^2) edges.
An algorithm generates all cycle permutation graphs up to order 34 and permutation snarks up to 46, completing the characterization of orders for non-hamiltonian cycle permutation graphs.
citing papers explorer
-
Hypergraph independence bounds: from maximum degree to average degree
Transfer theorem converts max-degree independence bounds to average-degree bounds for hereditary uniform hypergraphs, with applications to cycle-free graphs and bounded-clique graphs.
-
Colour-balanced subgraphs
Colour-balanced k-edge-coloured K_{2kt} has a perfect matching adjustable to colour-balance by recolouring O(k^2) edges.
-
Generation of Cycle Permutation Graphs and Permutation Snarks
An algorithm generates all cycle permutation graphs up to order 34 and permutation snarks up to 46, completing the characterization of orders for non-hamiltonian cycle permutation graphs.