Zero-sum flows for triple systems

DOI10.1016/J.DISC.2016.08.014MaRDI QIDQ729773zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 22 December 2016

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.04096

zbMATH Keywords

chromatic index of Steiner systemsSteiner systemSteiner triple systemzero-sum flow

Mathematics Subject Classification ID

Triple systems (05B07) Coloring of graphs and hypergraphs (05C15)

Abstract: Given a $2$-$(v,k,lambda)$ design, $calS=(X,calB)$, a {it zero-sum $n$-flow} of $calS$ is a map $f:calBlongrightarrowpm1,ldots,pm(n-1)$ such that for any point $xinX$, the sum of $f$ around all the blocks incident with $x$ is zero. It has been conjectured that every Steiner triple system, STS$(v)$, on $v$ points $(v>7)$ admits a zero-sum $3$-flow. We show that for every pair $(v,lambda)$, for which a triple system, TS$(v,lambda)$ exists, there exists one which has a zero-sum $3$-flow, except when $(v,lambda)in(3,1),(4,2),(6,2),(7,1)$ and except possibly when $vequiv10pmod12$ and $lambda=2$. We also give a $O(lambd{a}^2{v}^2)$ bound on $n$ and a recursive result which shows that every STS$(v)$ with a zero-sum $3$-flow can be embedded in an STS$(2v+1)$ with a zero-sum $3$-flow if $vequiv3pmod4$, a zero-sum $4$-flow if $vequiv3pmod6$ and with a zero-sum $5$-flow if $vequiv1pmod4$.

Recommendations

• Zero-sum flows for Steiner systems
• Zero-sum flow numbers of triangular grids
• Zero-sum flows in designs
• Zero-sum flows in regular graphs
• Zero-sum flows of the linear lattice.

Cites work

• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• 2-starters, graceful labelings, and a doubling construction for the Oberwolfach problem
• A complete solution to the two-table Oberwolfach problems
• A Contribution to the Theory of Chromatic Polynomials
• A generalization of 0-sum flows in graphs
• A note on zero-sum 5-flows in regular graphs
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• Cyclic block designs with block size 3
• Cyclic block designs with block size 3 from Skolem-type sequences
• Hanani triple systems
• scientific article; zbMATH DE number 5917757 (Why is no real title available?)
• scientific article; zbMATH DE number 3922695 (Why is no real title available?)
• scientific article; zbMATH DE number 1314686 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• On sharply vertex transitive 2-factorizations of the complete graph
• On the Oberwolfach problem with two similar length cycles
• On zero-sum 6-flows of graphs
• Some cyclic solutions to the three table Oberwolfach problem
• Some observations on the oberwolfach problem
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• The CRC handbook of combinatorial designs
• The Existence and Construction of Balanced Incomplete Block Designs
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The Oberwolfach problem and factors of uniform odd length cycles
• Zero-sum flow numbers of regular graphs
• Zero-sum flows in designs
• Zero-sum flows in regular graphs
• Zero-sum flows of the linear lattice.

Cited in

(6)

• Circular zero-sum r-flows of regular graphs
• Zero-sum flows for Steiner systems
• Zero-sum flows in designs
• Nowhere-zero bases for the nullspace of the incidence matrices of graphs
• On ergotropic gap of tripartite separable systems
• \(L_{\infty}\) norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs

This page was built for publication: Zero-sum flows for triple systems

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