Regular subgraphs of almost regular graphs
From MaRDI portal
Publication:595688
DOI10.1016/0095-8956(84)90047-9zbMath0527.05059OpenAlexW2006725243MaRDI QIDQ595688
Gil Kalai, Noga Alon, Shmuel Friedland
Publication date: 1984
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(84)90047-9
Related Items (45)
Regular subgraphs of dense graphs ⋮ On Even-Degree Subgraphs of Linear Hypergraphs ⋮ On the complexity of the parity argument and other inefficient proofs of existence ⋮ Total \([1,2\)-domination in graphs] ⋮ A generalization of Kruyswijk-Olson theorem on Davenport constant in commutative semigroups ⋮ On the vertex irregular reflexive labeling of several regular and regular-like graphs ⋮ Warning's second theorem with relaxed outputs ⋮ Zero-sum problems for abelian \(p\)-groups and covers of the integers by residue classes ⋮ Zero-sum problems in finite Abelian groups: a survey ⋮ An asymptotically tight bound for the Davenport constant ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Blow-up lemma ⋮ Zero-sum problems -- a survey ⋮ On graph decompositions modulo \(k\) ⋮ General graph pebbling ⋮ Graph factors modulo \(k\) ⋮ Equicovering subgraphs of graphs and hypergraphs ⋮ Distinct degrees and homogeneous sets ⋮ The mod k $k$ chromatic index of graphs is O(k) $O(k)$ ⋮ Zero-sum problems and coverings by proper cosets ⋮ A note on internal partitions: the 5-regular case and beyond ⋮ Resolution of the Erdős–Sauer problem on regular subgraphs ⋮ On the existence of zero-sum subsequences of distinct lengths ⋮ Nearly-linear monotone paths in edge-ordered graphs ⋮ On zero-sum subsequences of restricted size. II. ⋮ Normal sequences over finite abelian groups ⋮ Problems and results in extremal combinatorics. I. ⋮ Maximum hypergraphs without regular subgraphs ⋮ Set systems with no union of cardinality 0 modulo \(m\) ⋮ Additive bases of vector spaces over prime fields ⋮ Two zero-sum problems and multiple properties ⋮ Combinatorial nullstellensatz modulo prime powers and the parity argument ⋮ On Davenport's constant ⋮ Colorings and orientations of graphs ⋮ Davenport constant for semigroups. ⋮ Unnamed Item ⋮ Lucky labelings of graphs ⋮ Unnamed Item ⋮ Weight choosability of graphs ⋮ Cohen-Macaulayness of a class of graphs versus the class of their complements ⋮ Regular Turán numbers of complete bipartite graphs ⋮ Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph ⋮ Every 4-regular graph plus an edge contains a 3-regular subgraph ⋮ 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs ⋮ On 2-coloring certain \(k\)-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- [a,b-factors of graphs]
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- Diophantine problems in variables restricted to the values 0 and 1
- A combinatorial problem on finite Abelian groups. II
- A combinatorial problem on finite Abelian groups. I
- Representations by \(k\)-th powers in \(GF(q)\)
- A remark on the factor theorems of lovász and tutte
- The Subgraph Problem
- Three‐regular subgraphs of four‐regular graphs
This page was built for publication: Regular subgraphs of almost regular graphs
