About: Flow-continuous mappings : The influence of the group

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Flow-continuous mappings : The influence of the group Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://dx.doi.org/10.1016/j.ejc.2013.05.033
Description	Many conjectures at the core of graph theory can be formulated as questions about certain group-valued flows: examples include the cycle double-cover conjecture, the Berge-Fulkerson conjecture, and Tutte's 3-flow, 4-flow, and 5-flow conjectures. As an approach to these problems, Jaeger, and DeVos, Nesetril, and Raspaud define a notion of graph morphisms continuous with respect to group-valued flows. We discuss the influence of the group on these maps. In particular, we prove that the number of flow-continuous mappings between two graphs does not depend on the group, but only on the largest order of an element of the group (i.e., on the exponent of the group). Further, there is a nice algebraic structure describing for which groups a mapping is flow-continuous. On the combinatorial side, we show that for cubic graphs the only relevant groups are Z(2), Z(3), and Z. Many conjectures at the core of graph theory can be formulated as questions about certain group-valued flows: examples include the cycle double-cover conjecture, the Berge-Fulkerson conjecture, and Tutte's 3-flow, 4-flow, and 5-flow conjectures. As an approach to these problems, Jaeger, and DeVos, Nesetril, and Raspaud define a notion of graph morphisms continuous with respect to group-valued flows. We discuss the influence of the group on these maps. In particular, we prove that the number of flow-continuous mappings between two graphs does not depend on the group, but only on the largest order of an element of the group (i.e., on the exponent of the group). Further, there is a nice algebraic structure describing for which groups a mapping is flow-continuous. On the combinatorial side, we show that for cubic graphs the only relevant groups are Z(2), Z(3), and Z. (en)
Title	Flow-continuous mappings : The influence of the group Flow-continuous mappings : The influence of the group (en)
skos:prefLabel	Flow-continuous mappings : The influence of the group Flow-continuous mappings : The influence of the group (en)
skos:notation	RIV/00216208:11320/14:10286666!RIV15-MSM-11320___
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GPP201/10/P337), P(LL1201)
http://linked.open...iv/cisloPeriodika	February
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Nešetřil, Jaroslav Šámal, Robert
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	17070
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/14:10286666
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	group; Flow-continuous mappings (en)
http://linked.open.../riv/klicoveSlovo	group Flow-continuous mappings
http://linked.open...odStatuVydavatele	GB - Spojené království Velké Británie a Severního Irska
http://linked.open...ontrolniKodProRIV	[F7A0C5620482]
http://linked.open...i/riv/nazevZdroje	European Journal of Combinatorics
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Complex Structures: Regularities in Combinatorics and Discrete Mathematics Flows and cycles in graphs using mappings between graphs
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	36
http://linked.open...iv/tvurceVysledku	Nešetřil, Jaroslav Šámal, Robert
http://linked.open...ain/vavai/riv/wos	000328869800031
issn	0195-6698
number of pages	6 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.ejc.2013.05.033
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software