Regular subgraphs of almost regular graphs
From MaRDI portal
Publication:595688
DOI10.1016/0095-8956(84)90047-9zbMATH Open0527.05059OpenAlexW2006725243MaRDI QIDQ595688FDOQ595688
Authors: Noga Alon, Gil Kalai, S. 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
Cites Work
- Title not available (Why is that?)
- Graph theory with applications
- Title not available (Why is that?)
- A combinatorial problem on finite Abelian groups. I
- A combinatorial problem on finite Abelian groups. II
- Three‐regular subgraphs of four‐regular graphs
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- A remark on the factor theorems of lovász and tutte
- The Subgraph Problem
- [a,b]-factors of graphs
- Diophantine problems in variables restricted to the values 0 and 1
- Representations by \(k\)-th powers in \(GF(q)\)
- Title not available (Why is that?)
Cited In (47)
- Weight choosability of graphs
- Distinct degrees and homogeneous sets
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
- Title not available (Why is that?)
- Equicovering subgraphs of graphs and hypergraphs
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- Davenport constant for semigroups.
- Zero-sum problems and coverings by proper cosets
- Lucky labelings of graphs
- On the existence of zero-sum subsequences of distinct lengths
- Betti numbers of edge ideals of Grimaldi graphs and their complements
- On graph decompositions modulo \(k\)
- Regular Turán numbers of complete bipartite graphs
- Warning's second theorem with relaxed outputs
- Zero-sum problems for abelian \(p\)-groups and covers of the integers by residue classes
- On 2-coloring certain \(k\)-uniform hypergraphs
- A generalization of Kruyswijk-Olson theorem on Davenport constant in commutative semigroups
- Zero-sum problems -- a survey
- Total \([1,2]\)-domination in graphs
- Regular subgraphs of dense graphs
- The mod k $k$ chromatic index of graphs is O(k) $O(k)$
- Resolution of the Erdős–Sauer problem on regular subgraphs
- Blow-up lemma
- Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\)
- On the complexity of the parity argument and other inefficient proofs of existence
- On zero-sum subsequences of restricted size. II.
- Problems and results in extremal combinatorics. I.
- Two zero-sum problems and multiple properties
- Graph factors modulo \(k\)
- Nearly-linear monotone paths in edge-ordered graphs
- The vertex irregular reflexive labeling of some almost regular graph
- Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph
- Maximum hypergraphs without regular subgraphs
- Additive bases of vector spaces over prime fields
- Set systems with no union of cardinality 0 modulo \(m\)
- Colorings and orientations of graphs
- On the vertex irregular reflexive labeling of several regular and regular-like graphs
- Normal sequences over finite abelian groups
- On even-degree subgraphs of linear hypergraphs
- Combinatorial nullstellensatz modulo prime powers and the parity argument
- Cohen-Macaulayness of a class of graphs versus the class of their complements
- An asymptotically tight bound for the Davenport constant
- Graph factors and factorization: 1985--2003: a survey
- On Davenport's constant
- Zero-sum problems in finite Abelian groups: a survey
- A note on internal partitions: the 5-regular case and beyond
- General graph pebbling
This page was built for publication: Regular subgraphs of almost regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q595688)
