| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:On the sharpness of some results relating cuts and crossing numbers
Authors:ID Beaudou, Laurent (Author)
ID Bokal, Drago (Author)
Files:.pdf Electronic_Journal_of_Combinatorics_2010_Beaudou,_Bokal_On_the_sharpness_of_some_results_relating_cuts_and_crossing_numbers.pdf (119,22 KB)
MD5: C87BD3696801D32B091878645D4F94EC
 
URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r96
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:It is already known that for very small edge cuts in graphs, the crossing number of the graph is at least the sum of the crossing number of (slightly augmented) components resulting from the cut. Under stronger connectivity condition in each cut component that was formalized as a graph operation called zip product, a similar result was obtained for edge cuts of any size, and a natural question was asked, whether this stronger condition is necessary. In this paper, we prove that the relaxed condition is not sufficient when the size of the cut is at least four, and we prove that the gap can grow quadratically with the cut size.
Keywords:mathematics, graph theory, crossing number, zip product, graph cuts
Publication status:Published
Publication version:Version of Record
Submitted for review:27.02.2009
Article acceptance date:28.06.2010
Publication date:10.07.2010
Publisher: Electronic Journal of Combinatorics
Year of publishing:2010
Number of pages:str. 1-8
Numbering:Letn. 17, št. 1
PID:20.500.12556/DKUM-49391 New window
ISSN:1077-8926
UDC:519.17
ISSN on article:1077-8926
COBISS.SI-ID:15638361 New window
NUK URN:URN:SI:UM:DK:A59XBR3O
Publication date in DKUM:10.07.2015
Views:1285
Downloads:264
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:The Electronic journal of combinatorics
Shortened title:Electron. j. comb.
Publisher:N.J. Calkin and H.S. Wilf
ISSN:1077-8926
COBISS.SI-ID:6973785 New window

Document is financed by a project

Funder:ARRS - Slovenian Research Agency
Project number:P1–0297
Name:Teorija grafov

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:10.07.2015

Secondary language

Language:Slovenian
Title:O natančnosti nekaterih rezultatov, ki povezujejo prereze in prekrižna števila
Abstract:Znano je, da je za majhne povezavne prereze prekrižno število grafa večje ali enako vsoti prekrižnih števil nekoliko dopolnjenih komponent, ki nastanejo ob prerezu. Ob močnejših predpostavkah povezanosti vsake od komponent, ki je bilo formalizirano kot grafovska operacija 'šiv', pa lahko podoben rezultat pokažemo za povezavne prereze poljubne velikosti. Zastavi se naravno vprašanje, ali je ta pogoj potreben. V tem prispevku pokažemo, da šibkejše zahteve za povezanost komponent ne zadoščajo, če prerez vsebuje vsaj štiri povezave. Razlika med vsoto prekrižnih števil komponent in skupnega grafa lahko narašča kvadratično z velikostjo prereza.
Keywords:matematika, teorija grafov, prekrižno število, šiv grafov, prerez v grafih


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica